Can someone do q2 and q3 asap

Recitation 8 Given the undirected graph G, as represented by the provided matrix, execute the following algorithms. A non-zero entry represents an edge with that specific weight. 1. Provide a graphic depiction and adjacency-list representation of the graph 2. Using DFS and starting at node 2, search for node 1 and show the order in which the nodes are explored. Assume a smaller edge weight preference when deciding which node to explore next. 3. Using BFS and starting at node 2, search for node 10 and show the order in which the nodes are explored. Assume a smaller label preference when deciding how to insert unexplored nodes into the discovery queue