Question 3: DFA, PDA, and Turing Machine (20 pts) 1. Consider the following language L ={ cka"b"}and the string w= ccccaabbb; which of the followings are trues (6) a. DFA: 10 steps to accept b. PDA: 9 pop and 9 push operations c. Turing Machine: 9 reads, 9 writes, and 9 moves d. Turing machine, which rewinds the input tape to the beginning: 9 reads, 9 writes, and 18 moves Question 3: DFA, PDA, and Turing Machine (20 pts) 1. Consider the following language L ={ cka"b"}and the string w= ccccaabbb; which of the followings are trues (6) a. DFA: 10 steps to accept b. PDA: 9 pop and 9 push operations c. Turing Machine: 9 reads, 9 writes, and 9 moves d. Turing machine, which rewinds the input tape to the beginning: 9 reads, 9 writes, and 18 moves