Please provide proper C implementation of Infix to Postfix Conversion algorithm in slide 25 using Stack Data Structure. The input must be taken from a text file so that we can easily change the input each time we run your code. The file name must be infix_input.txt Your implementation should run without errors with any input size. Please also provide a detailed test code. Please provide a proper, correct, parameterized (meaning that input values can be given by users via command line or a text file) C implementation of the sample stack code provided in your slides (12-15) using a linked list. Your implementation should run without errors with any input size. Please also provide a detailed test code. The code in your slides are also copied below: //Declaration of a stack node struct StackNode { int data; struct StackNode *next; } typedef struct StackNode StackNode; typedef StackNode * StackNodePtr, StackNodePtr NodePtr, top; NodePtr = malloc(sizeof(StackNode)); top = NodePtr; NodePtr->data=2; // or top->data=2 NodePtr->next=NULL; // or top->next=NULL; Push(&top,&NodePtr); //Nodeptr is an output variable!!! Pop(&top); Void Push (StackNodePtr *TopPtr, StackNodePtr *NewNodePtr) { *NewNodePtr = malloc(sizeof(StackNode)); // NewNodePtr to pass to invoking function!!! (*NewNodePtr)->data=5; (*NewNodePtr)->next = *TopPtr; *TopPtr = *NewNodePtr; } Void Pop(StackNodePtr *TopPt) { StackNodePtr TempPtr; TempPtr= *TopPtr; *TopPtr = *TopPtr->next; free(Tempptr); // or you may return TempPtr!!! }