can someone explain?Execute Kruskals algorithm on the graph below and list the edges

in the order they are added to the minimal spanning tree. The

numbers are the edge weights. Since the edge weights are unique,

you can identify the edges by using their weights $($ie$,$ writing $12$

$3$ means adding edges ABCEBD $(5$ points$)$

Edges :

Execute Prims algorithm on the graph above and list the edges in

the order they are added to the minimal spanning tree. Begin with

node A: $(5$ points$)$