use basic data structure rules and in a coding format thanks.

Problem5 Implement the delimiter matching application Test for the following cases: c[d] // correct I/ correct // not correct; ] doesn't match ( // not correct; nothing matches final) // not correct; nothing matches opening .a(b(c) The pseudocode can be found in your books on page 123 and is as follows: -Create an empty stack. - Read characters until end of string. If the character is an opening symbol, push it onto the stack. If it is a closing symbol and the stack is empty, report an error. Otherwise, pop the stack. If the symbol popped is not the corresponding opening symbol, then report an error. At the end of the string, if the stack is not empty, report an error. For this problem, you need to submit your working c++ source code (.cpp file You can either implement your own stack as we did in class, or you can use c++'s standard library stack. If you choose to use the standard library, the class you need to use is called list and some of its functions are: void push front (abj):pushes obj onto the stack void pop front pops the stack obj front): performs a peek and returns the top of the stack bool empty ): checks if stack is empty