Consider the following directed graph given by adjacency lists $($first column indicates

the vertex, the second column lists its outgoing edges as a list$)$:

$($a$)(2$ pts$.)$ Write down the adjacency lists of the reverse of $G.$

$($b$)(4$ pts$.)$ Perform Depth$-$First Search on the reverse of $G$ and find a reverse

postorder of the vertices.

$($c$)(4$ pts$.)$ Perform Depth$-$First Search on $G$ using the order found in $($b$)$ to find

the strong components of $G.$