I would like to ask help with this c programming task. Make a c program with the following details:

Topological sorting problem: Given a finite set of pairs representing a partial order relation on a set SS, arrange the objects in a sequence such that no objects can appear before its direct predecessor(s). For this machine exercise, your task is to implement Knuth's algorithm for topological sorting (a pseudocode is given in Sir Quiwa's book and here. Input Format Consider the set of vertices as labelled 1 to nn. Thus, the first line is the value nn. The succeeding lines are the list of pairs. To indicate the end of the list, the value o O is given. (Note that oo is not part of the list. Also, you may assume that the input relation do not contain loops.) Sample input is given below. 15 1 2 23 45 51 5 12 56 76 89 10 11 12 10 12 13 13 14 13 9 14 15 00 Output Format The output is the output sequence following Knuth's algorithm. Sample output for the input given above is: 4 7 8 5 6 12 1 13 10 2 9 14 11 3 15 Sample code to check the content of your COUNT and LIST arrays. void print(int n, int *COUNT, Node **LIST) { Node *alpha; printf("num_vertex: %d ", n); printf("---- -- "); for (int i=0; iSUCC); alpha = alpha->NEXT; 1 printf(" "); } 1<>