Let a graph G consist of a set E with n edges, and a set V of m vertices. Describe how to modify Prim's algorithm to check if Gis connected. Note: Explain your answer in your own words. Do not give an...

Extracted text: Let a graph G consist of a set E with n edges, and a set V of m vertices. Describe how to modify Prim's algorithm to check if Gis connected. Note: Explain your answer in your own words. Do not give an algorithm in pseudo-code or any other code. Maximum number of characters (including HTML tags added by text editor): 32,000 Show Rich-Text Editor (and character count)