Design an algorithm $($pseudocode$)$ that recognizes $($accepts$)$ strings of the following context$-$

free language: L $=\{0$n$1$n : where n $>=1\}.$ That is$,$ strings that contain a number of zeros

followed by the same number of ones. Examples of strings in the language are: $01,0011,$

$000111,$ etc. Strings that are not in the language are, for example, $10,00,111,1100,0101,$

and many more. The algorithm should take a string of $0$s and $1$s as input and output $$Yes$$

if the string belongs to the language, and $$No$$ if the string doesn$$t belong to the language.

The algorithm should use a stack. When it reads a $0$ from the string, it pushes $0$ onto the

stack. When it reads a $1,$ it checks if the stack has a $0,$ in which case that $0$ is popped from

the stack. When the stack is empty and the end of the string is reached, the string is

recognized as correct $($Yes$).$ Otherwise, the string is not in the language $($No$).$

$($b$)[3$ marks$]$ Implement the algorithm of $($a$)$ in your favorite programming language