a$)$ Illustrate a minimum spanning tree $($MST$)$ using Kruskal's Algorithm for the

graph in Figure $3.$ Determine the total weight of MST$.$

$(8$ marks$)$

b$)$ Compare Prim's algorithm with Kruskal's algorithm for the following aspects:

i$.$ Objective

ii$.$ Algorithm nature

iii. Edge selection

iv$.$ Data structure preferred approach

v$.$ Types of application

vi$.$ Memory usage