Question$-1(20$ points$)$

For the graph given below, give the sequence of vertices when they are traversed

starting from vertex $C$ using

The depth$-$first traversal algorithm

The breadth$-$first traversal algorithm

In your solution, for a vertex, use the lexicographical order to visit its neighbors.

Question$-2(10$ points$)$

For the following weighted directed graph, find the shortest paths from vertex $A$ to all

other vertices using Dijkstra's shortest path algorithm. Show all steps of Dijkstra's

algorithm.