2. Consider the following undirected graph G: 3 (a) Give the adjacency matrix representation of G. (b) Give the adjacency list representation of G for every vertex. (c) Give the search ordering by running the Breadth First Search (BFS) algorithm on G with 3 as the source vertex. (d) Give the search ordering generated by running the Depth First Search (DFS) algorithm on G with 3 as the source vertex. For each vertex in the DFS tree, please also indicate the start time and the finish time generated by the DFS algorithm