$2.$ The common application of Stack is delimiter checking, i$.$e$.,$ parsing that involves analyzing a source program syntactically. It is also called parenthesis checking. When the compiler translates a source program written in some programming language such as C$,$ C$++$ to a machine language, it parses the program into multiple individual parts such as variable names, keywords, etc. By scanning from left to right. The main problem encountered while translating is the unmatched delimiters. We make use of different types of delimiters include the parenthesis checking $(,),$ curly braces $\{,\}$ and square brackets $[,],$ and common delimiters $/*$ and $*/.$ Every opening delimiter must match a closing delimiter, i$.$e$.,$ every opening parenthesis should be followed by a matching closing parenthesis. Also, the delimiter can be nested. The opening delimiter that occurs later in the source program should be closed before those occurring earlier. For example, Valid Delimiter Invalid Delimiter While $($ i $>0)$ While $($ i $>/*$ Data Structure $*//*$ Data Structure $\{($ a $+$ b$)-$ c $\}\{($ a $+$ b$)-$ c To perform a delimiter checking, the compiler makes use of a stack. When a compiler translates a source program, it reads the characters one at a time, and if it finds an opening delimiter it places it on a stack. When a closing delimiter is found, it pops up the opening delimiter from the top of the Stack and matches it with the closing delimiter. Create a class named DelimiterChecker to check whether an expression is valid or not. Write a method called receive$\_$expression$($expression$),$ to receive an expression. Write a method called verify$()$ to verify the $.$ Use test case below to test your delimiter checker. Expression: $[\{($a$-$b$)*($c$-$d$)\}/$f$]$ should return True Expression: $[\{($a$-$b$)*($c$-$d$)\}/$f should return False