3. (4 points) Read from Figure 1: Turing Machine 1 the description of turing machine and for how many steps does the Turing machine run on input string "a" before the Turing machine halts? Here is a description of a Turing machine. The input alphabet is fa, b]. The state set is: The transition function is given in the table below do 41 42 93 a (q1, a, R) (q1, a, R (42, a, R) (lacc, a, R) (Grej, a, R) Figure 1: Turing Machine 1 A. 1 step B. 2 steps C. 3 steps D. 4 steps H. N one of the above