for B Figure 1. Graph G1 a) Give the depth-first traversal of the graph, starting from vertex C. (in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) b) Give the breadth-first traversal of the graph, starting from vertex C. (in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) c) Find the shortest path between node C and all other nodes in the graph, using Dijkstra's algorithm. List the path and cost of the path for B Figure 1. Graph G1 a) Give the depth-first traversal of the graph, starting from vertex C. (in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) b) Give the breadth-first traversal of the graph, starting from vertex C. (in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) c) Find the shortest path between node C and all other nodes in the graph, using Dijkstra's algorithm. List the path and cost of the path