Answer Happy

Please answer the following questions for number one withdetails
Q.1 [20 Pts] Graph Representation: Consider the following graph G and answer questions given below. a) [10 Points] Represent the above graph using adj-matrix and adj-list techniques. 1 M b) [10 Points] The following table shows all the graph algorithms that we have discussed in the class. Fill the second and third column indicating running time and the space requirement for each algorithm Algorithm Running Time Space Requirements BFS DFS Prim's Kruska's Dijkstra Bellman-Ford 2. (15 points) Consider the graph G given below. Compute an MST of G using Prim's algorithm. Specifically, list the edges selected into the tree in the correct order, and then draw the final MST. Must show all the intermediate steps for full credit