The square of a directed graph G = (V, E) is the graph G² = (V, E²) such that (u, ν) ∈ E² if and only G contains a path with at most two edges between u and ν. Describe efficient algorithms for computing G² from G for both the adjacency-list and adjacency-matrix representations of G. Analyze the running times of your algorithms.