data structures

2) Given the following graph: A 2 B 3 C 15 5 17 12 18 4 D 13 E F LO 11 7 9 14 G 19 H 8 1 16 1 A) Write (in order) the list of vertices that would be visited by running a breadth-first search (BFS) and a depth-first search (DFS) starting from A. B) Draw a Dijkstra's Shortest Path and find the Minimum total cost by drawing adjacency matrix. C) Draw a Kruskal's algorithm and Minimum Spanning Tree Algorithm. D) Compare the time complexity of the Dijkstra's Algorithm, Kruskal's Algorithm and Prim Algorithms as a Greedy algorithm for this graph