a.Draw a Turing machine (using Sipser notation) having at least 4 nontrivial (i.e., nonrejecting) states and at least six nontrivial (i.e., not to the rejecting state) transitions.

b. Use set notation to define the language this machine recognizes. The language must be nontrivial (i.e., it must not be either the empty language or Sigma^* for some alphabet Sigma^*).

c. Give the binary encoding of this Turing machine two input strings: one in the language and one not.

d. For both of the strings in part c, give the contents of the tape of your universal Turing machine at the time it halts when given the strings from part c as input.