A string over the characters ( and ) is said to be well- parenthesized if the left and right parenthesis are matched up properly. As an example, (()) and ()() are well-parenthesized. However, )( or ())( are not. For = {),(}, let L consist of strings which are well-parenthesized expressions. Design a single tap deterministic Turing Machine M which halts on all inputs and L(M) = L.

This is the question, no more info can be provided