The transpose of a directed graph G = (V, E) is the graph G^T = (V, E^T),

where E^T = Consists of all edges such as (v, u) such that (u, v) E. Thus, G^T is G with all edges reversed.

Write the pseudocode of the most efficient algorithm possible for computing G^T from G, for the adjacency-list representation of G. This means you are starting from the adjacency-list representation of G and making an adjacency-list representation of G^T. You can use extra space / data structures, space complexity doesnt matter.

Derive and explain the time complexity.