we saw a Turing machine deciding the set B = {w#w w {0, 1)'). In this question, you will modify this machine so that it decides the set of all words w#u such that w-lul and the binary representation of w is greater than or equal to the binary representation of u. For example, 100#1011 would be accepted because 12 11. a) Give an implementation-level description of your machine. Follow the style and conventions demonstrated on page 167. b) Draw the state diagram formalizing the machine you described in part (a). You may use the abbre- viations used on page 178 and on this week's Individual Homework: omit all outgoing transitions for the accept and reject states, and omit all incoming transitions to the reject state c) If you swapped the reject state with the accept state in this machine, would it read the language: Why or why not? we saw a Turing machine deciding the set B = {w#w w {0, 1)'). In this question, you will modify this machine so that it decides the set of all words w#u such that w-lul and the binary representation of w is greater than or equal to the binary representation of u. For example, 100#1011 would be accepted because 12 11. a) Give an implementation-level description of your machine. Follow the style and conventions demonstrated on page 167. b) Draw the state diagram formalizing the machine you described in part (a). You may use the abbre- viations used on page 178 and on this week's Individual Homework: omit all outgoing transitions for the accept and reject states, and omit all incoming transitions to the reject state c) If you swapped the reject state with the accept state in this machine, would it read the language: Why or why not