Please do answer for the second diagram (g - h).

2. To answer this problem, please draw the following graph in your answer sheet. [10 marks] We run the DFS algorithm on the graph. Write down the start and finish time on all nodes. For example, if a node was visited at time 5 and was finished at time 10, write 5/10 beside the node. In order to have a unique answer, always pick the node or the neighbor that has a smaller letter (a is smaller than b, and so on). a) b) [5 marks] Classify the edges of this graph according to the DFS algorithm in part (a). Since this is an undirected graph you will only have tree edges and back edges. If an edge is a tree edge write the letter T on that edge, and if it is a back edge write the letter B on the edge