The reverse of a directed graph G = (V, E) is another directed graph GR = (V, ER) on the same vertex set, but with all edges reversed; that is, ER = {(v, u) where (u, v) belongs to E}. Give an...

The reverse of a directed graph G = (V, E) is another directed graph GR = (V, ER)

on the same vertex set, but with all edges reversed; that is, ER = {(v, u) where (u, v)

belongs to E}. Give an algorithm for computing the reverse of a graph in adjacency

list format. You may assume that the vertices are integers 1 to N. Specify its space

and time complexity.