IN C LANGUAGE PLS

1. Write a program to perform a topological sort on a graph (Note: you may choose the graph on page 32 in DSA2021_12 as input) 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 the topological sort result to screen