!!!URGENT!!

please read the question properly and answer in C language.

Write a program that asks the uner to enter a leries of panentheien asdlor beaces and then indicate whether or not they ace propecly nested. Enter parentheses and/oe braces: (C)(XI()) Barentheses are neited properly Enter, parentheses and/or traces? ((2+2){(6/2}{7(2+3),13)29)(1+3). Faremtheses are fested \#roperly Parentheses are net nested sroperly The program stores theie braces en a stakk that has a maximum sure/capacity ef 10 itema. Hint: Given that a stack is a "Last in. First Out" [LFOG datu structurt, it can help you dheck if the parentheses are balanced or not. Remember thut al parentheses need to be belancet. Thes means that if your mach the end of the uier input (ie, a newlinel, you thould theck that the aks in neptr. Othmaine the paranetheies are not fully matohed. Remeerber to alio thedk it the itack has inached masimum capacity beform arsempeing to puch any new items on it if the teack has already ieached its manimum capacy. and the program tries to push additionat items, the program should prine the mescage : immediately. The program must accept characbers otber than 4. . I. W. but igsorps them in the processing die. they are not. puated onto the stack and it does not atterpt to match them to existing teirs on the stacki. Wout progtam must consist of the following tiles: - Thera sumur - than contans the main fumction - staci that contains all the stack operations - stan in that contains the declaations of the functions is You must create a Makefile that compiles and licks shock_zn tive s and stack. - into an evecutable caled alista minumine Files that need to be on Githubc * iniatiran * itirina * x+4+11 Demo: - Esplain your algorithm - Show your TA the functions in your program and that they conmipond to what is specifed above - Compile your program using nsi. - Your TA wilt tell you what input to run your program wath imaliple numb * Ran en cla clain Grading: 5 marks total - I mark for spltting program inbe hh and e tiles and crnating a conect Mukntil - I mark detects comect neiting - I mark: detects incoerect nesting - 1 mark conrectly igneres eutca charactens in input - I mark conecty handles butler overfiow