Practical application $1$: Arithmetic operations.

$($a$)[3$ marks$]$ Design an algorithm that takes a string, which represents an arithmetic

operation, as input and checks whether or not the brackets are correct $($balanced$)$ or incorrect $($unbalanced$).$ The input string may contain a combination of the following characters: $\{,\},[,],(,),0,1,2,3,4,5,6,7,8,9,+,-,*,/.$ An obvious hint for this algorithm is to use the stack$-$ based solution discussed in class as a template, and hence you can use the stack implemented in #$1.$ Your algorithm must not check the correctness of the arithmetic operators$/$operands$,$ but only check for balanced brackets. Your algorithm should also show an error message when the string contains a character that is not one of those listed above. Provide the pseudocode of the algorithm.