Write a client function parenthesesMatch that given a string containing only the characters for parentheses,

braces or curly braces, i$.$e$.,$ the characters in $\text{'}([\{\}])\text{'},$ returns True if the parentheses, brackets and braces match

and False otherwise. Your solution must use a Stack. For, example:

Hint: It is not sufficient to just count the number of opening and closing marks. But, it is easy to write this as a

simple application of the Stack class. Here is an algorithm:

Create an empty stack.

Iterate over the characters in the given string:

a$.$ If the character is one of opening marks $(,$ push it on the stack.

b$.$ If the character is one of the closing marks$),],\}$ and the stack is empty, then there were not enough

preceding opening marks, so return False.

c$.$ If the character is a closing mark and the stack is not empty, pop an $($opening$)$ mark from the stack. If

they are not of the same type, ie$.,($and $)$ or $[$ and $]$ or $\{$ and $\},$ return False, if they are of the same

type, move on to the next char.

Once the iteration is finished, you know that the parentheses match if and only if the stack is empty.