Algorithm

Question 1: Please write algorithm IsMinSpanningTree(G, T), that will take a graph G=(V, E) and a tree T=(V,
ET) and returns true if T is an MST in G graph. where MST is minimum spanning tree. Please Provide
pseudocode and Code implementation using Python.
Question 2: Find a minimum spanning tree for the attached graph. You can use either Prim’s or Kruskal’s
algorithm. Show the steps taken by your algorithm in finding the MST.

Sample Solution

ACED ESSAYS