The transpose of a directed graph G = (V, E) is the graph G^T = (V, ET), where E^T = {(ν, u) ∈ V × V : (u, ν) ∈ E}. Thus, G^T is G with all its edges reversed. Describe efficient algorithms for computing G^T from G, for both the adjacencylist and adjacency-matrix representations of G. Analyze the running times of your algorithms.