Question 3: [10+10+15 Marks 1. Can a simple undirected graph G = (V, E be represented in adjacency list represen- tation using O(V2) space? Justify. 2. In a directed graph, G= (V, E), you need to determine whether does there exist a pair of vertices u, V EV, such that there is a directed path from vertex u to v as well as a directed path from vertex v to u. Present the main steps of your algorithm, indicate what is the running time without going in details), and some justification why it is correct. Is there a pair of vertices in the graph given below satisfying this condition