a -> b.R b-a,R a -> b,R b-b,L q, 2 a-> a,L a-> a.R b-b.R reject acce 3a. [10 points] Write all 7 components of the formal description of this TM. 3b [10 points] Write out the sequence of configurations this TM goes through on each of the following inputs: aaa, aba, bbba, baaba. 3c [10 points. Argue why this TM decides a language, and say what language it decides 3d. [10 points] Show that the language decided by this TM is actually regular