The transpose of a directed graph $G=(V,E)$ is the graph $G^{TT}=(V,E^{TT}),$ where $E^{TT}=$ Consists of all edges such as $(v,u)$ such that $(u,v)inE.$ Thus, $G^{TT}$ is $G$ with all edges reversed.

Write the pseudocode of the most efficient algorithm possible for computing $G^{TT}$ 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^{TT}.$ You can use extra space $/$ data structures, space complexity doesn't matter.

Derive and explain the time complexity.

Note: Do not hardcode any cases into the algorithm, write a general algorithm for any $V$ and $E.$