Let a binary string be called right dominant if one can find a matching between 0's and 1's such that for every 0, there is a 1 to the right of that 0 which isn't already matched to another 0. For example, the following binary strings are right dominant: 11, 011, 001011, and 11001101, whereas the following binary string are not right dominant: 10, 01110, and 10011110. Construct a Turing machine which accepts the language of right dominant binary strings. (a) Give a top level algorithmic description of how your Turing machine operates. [3 (b) Hoonally inve all in or 0.31tioa ragarding*, your ,nrtug machina, i.e. , Q, l' and i You may assume -{0, 1). Give an English description to each state and what it represents. [7]