The reverse of a directed graph $G=(V,E)$ is another directed graph $G^R=(V,E^R)$ on the same vertex set, but with all edges reversed; that is$,E^R=\{(v,u)$:$(u,v)inE\}.$

Give a linear$-$time algorithm for computing the reverse of a graph in adjacency list format.