a) Perform a depth-first traversal of the graph shown above, starting with vertex C. Select the smallest edge first when appropriate. Show the Stack implementation. b) Perform a breadth-first traversal of the graph shown above, starting with vertex C. Select the smallest edge first when appropriate. Show the Queue implementation. c) Suppose you are using Dijkstra's algorithm to find the shortest paths from vertex A. Show the priority queue implementation. What is the shortest from A to H