The complement of a graph G is a graph where the vertices ofare the same as the vertices of G, but u and v are adjacent in G if and only if they are not adjacent in G. For example, the graphs below are complements of one another 2 4 4 for a graph G and returns the adjacency matrix of the complement of G 4. Give pseudocode for an O(n2) algorithm that accepts an unoptimized adjacency list (i.e., an array of sorted arrays) and returns an adjacency list of the complement of G. The complement of a graph G is a graph where the vertices ofare the same as the vertices of G, but u and v are adjacent in G if and only if they are not adjacent in G. For example, the graphs below are complements of one another 2 4 4 for a graph G and returns the adjacency matrix of the complement of G 4. Give pseudocode for an O(n2) algorithm that accepts an unoptimized adjacency list (i.e., an array of sorted arrays) and returns an adjacency list of the complement of G