Question 20 6 pts a) Based on the undirected graph shown below, draw the BFS tree and DFS tree that will result when calling BFS and DFS starting at node C. List the order in which the nodes are visited in each traversal (BFS is the BFS traversal of the BFS tree, DFS is the preorder traversal of the tree). When performing the traversal, the cost of the edges is irrelevant, follow the alphabetical order convention discussed in the video lectures. b) What if the cost of the Minimum Spanning Tree for such graph? You can use any of the algorithms discussed in the lectures to compute the MST D 3 10 A B 5 4 10 2 3 11 2 E F G 2. 3. 4 7 H I J