please solve this in C language.

In this lab we will code the operator precedence parser in C. The grammar that we will use in our program is shown: EE+EEEEEid Note that here id may be a single lower-case alphabet. The operator precedence relation table is given: Your program should be able to parse any of the following strings: a+bc$xyz$w+r+t$jk+m$ Initially we have a stack carrying \$ symbol and another stack carrying input string. The input string is provided by the user as command line argument to your program. The main algorithm of this parser is given; Suppose stack 1 is the working stack. Input string is stored in stack 2 and stack3 is the output stack. If top of stack 1> top of stack2, then pop from stack1 and push it on stack3. If lop of stack