2 (14 pts) (a) Draw MR, the reverse graph of M, and construct an adjacency list ER. ER{A}=[B]ER{B}=[ER{C}=[ER{D}=[ER{E}=[ER{F}=[ER{G}=[ER{H}=[ (b) List the vertices of graph M in descending post order: V1={ Run a DFS (visited) on MR=(V1,ER). (c) Use parent to list the strongly connected components of M : Draw the DAG whose nodes are the meta-nodes consisting of the strongly connected components of M, and draw a directed edge from one meta-node to a second meta-node if there is at least one edge in M connecting a node in the first strongly connected component to a node in the second component