algorithm

1. (30 points) Below is a weighted undirected graph. (a) Show the DFS (depth-first search) tree found by the recursive DFS algorithm and list the vertices in the order of adding to the DFS tree. (b) Show the DFS tree found by the non- recursive DFS algorithm and list the vertices in the order of adding to the DFS tree. (c) Show the BFS (breadth- first search) tree found by the BFS algorithm and list the vertices in the order of adding to the BFS tree. (d) Show the MST (minimum spanning tree) found by Prim's algorithm and 4 4 list the vertices in the order of adding to the MST. (e) Compute the shortest paths from vertex A to all other vertices using Dijkstra's algorithm and list the vertices in the order of adding to the cloud. For all the above questions, we start with vertex A and ties are broken bv alphabet order of vertices