a find a minimal spanning tree for the graph shown in figure 1 using k

Question

a) Find a minimal spanning tree for the graph shown in Figure 1 using Kruskal's algorithm.Show the sequences of edges according to the order they are included and the total weight of the minimal spanning tree.
b) Find a minimal spanning tree for the graph shown in Figure 1 using Prim's algorithm from vertex A. Show the sequences of edges according to the order they are included and the total weight of the minimal spanning tree. c) Find the shortest path from A to D in the graph shown in Figure 1 using Dijkstra's algorithm.Show all the shortest paths found before the required path is found and the total length of the required shortest path. d) In the graph shown in Figure 1, find the sequence of vertices that will be visited when a depth first search is performed from vertex D, given that the vertices are stored in the adjacency list in alphabetical order. e) In the graph shown in Figure 1, find the sequence of vertices that will be visited when abreadth-first search is performed from vertex D, given that the vertices are stored in theadjacency list in alphabetical order.