IN C LANGUAGE PLS

2. Write a program to solve the single-source shortest-path problem, i.e., Dijkstra algorithm (Note: you may choose the graph on page 61 in DSA2021_12 as input and vertex 0 as start vertex) a) Implement with adjacency list. b) Implement the routines, e.g., InitializeGraph(), InsertEdge(), InDegree(), OutDegree(), etc. c) Store the graph information in a text file; d) Implement a ReadGraph() routine to call InitializeGraph() and InsertEdge() to construct the graph in memory. e) Output all shortest paths from vertex 0 to screen. 2. Write a program to solve the single-source shortest-path problem, i.e., Dijkstra algorithm (Note: you may choose the graph on page 61 in DSA2021_12 as input and vertex 0 as start vertex) a) Implement with adjacency list. b) Implement the routines, e.g., InitializeGraph(), InsertEdge(), InDegree(), OutDegree(), etc. c) Store the graph information in a text file; d) Implement a ReadGraph() routine to call InitializeGraph() and InsertEdge() to construct the graph in memory. e) Output all shortest paths from vertex 0 to screen