2. (10 marks) Apply the parentheses matching algorithm discussed in Lecture 4 (slide 15) to the following input sequence of tokens: There are three types of parehtheses in this sequence: (), [], and {. This algorithm checks using a stack, if all parentheses in the input sequence properly match. Show the content of the stack when the algorithm terminates, indicating clearly which end of the stack is the top. You do not have to show intermediate steps - show only the final stack