Need help with this to solve thanks.

Question 1: Graphs This question is similar to the question seen in Exercise 5. It is recommended that you complete Exercise 5 prior to attempting this question. For each of the two graphs given below, complete the following four items. No code is required for this question. 1. Draw the graph corresponding to the given adjacency matrix (graph 1) or adjacency list (graph 2). 2. Complete a depth-first traversal of the graph, beginning at vertex I. Format your answer as in Table 13.3 on 3. Complete a breadth-first traversal of the graph, beginning at vertex K. Format your answer as in Table 13.4 4. Use Dijkstra's algorithm to find the lowest-cost paths from vertex A to all other vertices. At each step, show page 626 of Lafore. Show the stack after each step on page 637 of Lafore. Show the queue after each step. the current least cost distance to each vertex, the previous vertex on that least cost path, and mark completed paths with an asterisk. Format your answer as in the "Weighted graphs and Dijkstra's algorithm" notes in Unit 10 Question 1: Graphs This question is similar to the question seen in Exercise 5. It is recommended that you complete Exercise 5 prior to attempting this question. For each of the two graphs given below, complete the following four items. No code is required for this question. 1. Draw the graph corresponding to the given adjacency matrix (graph 1) or adjacency list (graph 2). 2. Complete a depth-first traversal of the graph, beginning at vertex I. Format your answer as in Table 13.3 on 3. Complete a breadth-first traversal of the graph, beginning at vertex K. Format your answer as in Table 13.4 4. Use Dijkstra's algorithm to find the lowest-cost paths from vertex A to all other vertices. At each step, show page 626 of Lafore. Show the stack after each step on page 637 of Lafore. Show the queue after each step. the current least cost distance to each vertex, the previous vertex on that least cost path, and mark completed paths with an asterisk. Format your answer as in the "Weighted graphs and Dijkstra's algorithm" notes in Unit 10