Please Help with this question (Question 8). Answer typed preferred.

This is question 4 and figure 2:

This is my answer for question 4 ( not sure if it's right ).

Please note the chart is the answer based upon question number 4 in which that information would be used to help answer question 8. Again my answer for 4 could be wrong however.

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 Table Vertex 2 dpi 3 d pi 4d pi 5 d pi 6 dpi 1 11 11 2 done 11 22 22 3 3 done done 22 22 4 done done done 22 34 5 done done done done 34 6 done done done done done BFS tree 6 Shown in red has the BFS tree 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 Table Vertex 2 dpi 3 d pi 4d pi 5 d pi 6 dpi 1 11 11 2 done 11 22 22 3 3 done done 22 22 4 done done done 22 34 5 done done done done 34 6 done done done done done BFS tree 6 Shown in red has the BFS tree