Please Help. Answer typed preferred.

This is question 4 along with figure 2:

8. Show how the procedure Strongly-connected-components works on the graph in Figure 2. You can use your result in Question 4 as the first iteration of the DFS, but you need to draw a transpose graph of Figure 2. 4. Show the d and 7 values that result from running breadth-first search on the directed graph in Figure 2, using vertex 1 as the source Figure 2