Consider the graph below. Use Prim's algorithm to find a minimum spanning tree of the graph rooted in vertex 0. Note: enter your answer as a set of edges (E1,E..) separated by a comma and write each...

Extracted text: Consider the graph below. Use Prim's algorithm to find a minimum spanning tree of the graph rooted in vertex 0. Note: enter your answer as a set of edges (E1,E..) separated by a comma and write each edge as a pair of nodes between parentheses separated by a comma e.g. (0,1). For example, the answer may look like: ((0,1).(0,3).(1,4). Enter minimum spanning tree: What's the cost /weight of the minimum spanning tree?


Extracted text: What's the cost /weight of the minimum spanning tree?