Can anyone please help me solve this problem? Please only solve if 100 % percent sure and please show as many steps as possible. Thank you for your time.

1. Consider G, the undirected graph below which is represented by its adjacency matrix. (20 pts) draw the DFS tree. (5 pts) draw the BFS tree. (5 pts) vertex 1), and draw the DFS tree. (5 pts) a. Run the DFS algorithm on G starting from vertex 1 (top left corner is vertex 1), and b. Run the BFS algorithm on G starting from vertex 1 (top left corner is vertex 1), and c. Run the DFS algorithm on GT (G Transpose) starting from vertex 1 (top left corner is d. Run the BFS algorithm on GT (G Transpose) starting from vertex 1 (top left corner is vertex 1), and draw the BFS tree. (5 pts) 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0