Q$8.$ Find the minimum spanning tree of the given networkbelow.

a$)$ Apply Kruskal's algorithm $(8$p$.)$

b$)$ Apply Prim's algorithm $(8$p$.)$

c$)$ Which algorithm is better and why? $(2$p$.)$