(i) What is the value of the third edge chosen when finding a minimum spanning tree using Prim's algorithm? 4
(ii) What is the value of the third edge chosen when finding a minimum spanning tree using Kruskal's algorithm? 2
(iii) When using Dijkstra's algorithm to find the shortest path from S to all vertices, what is the value of the third edge chosen? 4
(iv) How many components are in the graph?
(v) What is the minimum number of edges you need to remove so the graph will have an Euler Tour? Mark the edges you would remove.
