Answer all Two questions

$220M=40M$

a$)$ Consider a standard $(1-$tape$)T{M}_1$ for a set of all strings of balanced parentheses. Perform the following tasks.

i$.$ Provide a state diagram for $T{M}_1.$

ii$.$ Discuss the state transitions of $TM$ in high$-$level language for the input strings $\{\{[\{(0)\}]\}\}$ and $(\{[]\})$