A-Using the Text file formatted below, create a graph with the Adjacency List method. B-Calculate the input and output degrees of the node number to be taken from the user and print it on the screen....

A-Using the Text file formatted below, create a graph with the Adjacency List method.
B-Calculate the input and output degrees of the node number to be taken from the user and print it on the screen.
C-Calculate the total number of edges on the graph and print it on the screen.
D-Scroll the entire graph according to the Breadth First Search Algorithm and print the navigation order on the screen.
E-Scroll the whole graph according to Depth First Search Algorithm and print the scrolling order on the screen. Also, print the arrival (d sequence) and processing (f sequence) times on the screen.
01011
10100
01011
10100
10100

Sample Text File Format: Each statement is separated by a space character.

(please use C language)