Question 3. Define a(k) to be the greatest number n, such that there there is a l-state basic turing machine which, when run on an initiallyall-zero tape, will perform exactly n steps before halting. Prove that a1=1, and 26 Challenge: Prove that o/2)=6 Challenge: What about a(3)?