a$.$ Apply the Kruskal's algorithm to the above graph to find the minimum spanning tree.

Demonstrate your steps on this problem. $(5$ points$)$

b$.$ Apply the Prim's algorithm to the above graph to find the minimum spanning tree.

Demonstrate your steps on this problem. $(5$ points$)$

c$.$ What are the similarities $(3$ points$)$ and differences $(3$ points$)$ between Kruskal's

algorithm and Prim's algorithm to find minimum spanning tree for a given graph? $($Total:

$6$ points$)$