In the following finite automaton (FA) or Turing machine (TM), the starting state is always 1 (91), and the accepting state is indicated by a double circle. Q1. (30 points) Illustrate the operation of this finite automaton (shown below) on each of the following inputs: (1) ababab (2) aabb (3) abba (Note: Example for input aa: B a a auto reject Q2. (30 points) Same problem as Q1, but for this FA below: P031 Q3. (40 points) Show the operation of this TM (shown below) on each of these inputs: (1) aabb c/c/R (2) abba 0 /elf@ 4/614_@) a/alik Spellen Ua/u/R blak 6/6/8 AAR