Consider the graph G shown on the right. Find the following. For full credit you have to show your work. 1. (5 points) A DFS tree starting at 1. Whenever you have to make a choice, pick the neighbour with the shortest number first 2. (5 points) A BFS tree starting at 1. Whenever you have to make a choice, pick the neighbour with the shortest number first 3. (5 points) A topological ordering of the nodes of G, if possible. 4. (5 points) The strongly connected components of G. 4 8