Apply the algorithm to the following graph:

22.1-5 The square of a directed graph G-( V, E) is the graph G2-(V, E*) such that (u, v) e E2 if and only G contains a path with at most two edges between u and v. 24, 1 Describe efficient algorithms for computing G2 from G for both the adjacency- list and adjacency-matrix representations of G. Analyze the running times of your algorithms 1 2 3 4 5 6 O I 0 1 OO 210 0 0 0 I0 3 0 0 0 0 1 4 01 0 0 5 0 0 01 0 0 6 0 0 0O 0 1 5 Figure 22.2 Two representations of a directed graph. (a) A directed graph G with 6 vertices and 8 cdges. (b) An adjacency-list representation of G. (c) The adjacency-matrix representation of G