Please only answer D, E, and F. For my discrete mathematical structures for computer science class. I'll be sure to thumbs up!

9. Consider the following weighted graph: 10 a. Write the adjacency matrix of the graph. b. Using Prim's algorithm, find the minimum spanning tree. Be sure to list the order in which the edges are added. Start from vertex e. c. Kruskal's algorithm, unlike Prim's, works by adding edges in non-decreasing order. What d. Using Djkstra's algorithm for finding shortests paths starting from vertex a, during the computation, vertices a and e have already been processed. Which vertex will be considered next