asap

M=(Q,,,,q0,accept,reject) where: Q={p0,q,r, accept, reject };={0,1};={B,0,1} Here, M has a one-way infinite tape, B is the designated blank symbol, q0 is the inital state, and accept and reject are the accepting and rejecting states. The transition rule is defined by the following diagram: In answers to the following questions, a list of configurations should begin with the initial configuration of the machine. (a) Write the first three configurations of the machine as it processes the input string w=00. Does M halt on input string w ? Answer: (b) Write the first three configurations of the machine as it processes the input string 1100 . Does M halt on input string w ? Answer: (c) Write the first three configarations of the machine as it processes the input string 01 . Does M halt on input string w ? Answer: (d) Write the first five configurations of the machine as it processes the input string 100 . Does M hlt on input string w? Answer: (e) Write a regular expression that defines the set of strings that are accepted by M. If such a regular expression does not exist, prove it