7. The transition function 8 of a turing machine is given by 8. The set of all turing machines is a. countably infinite b. uncountably infinite c. uncountably finite d. hello kitty recognizable 9. The set of all languages is a countably infinite b. uncountably infinite c. finite d. indeterminate 10.The number of all possible strings based on alphabet is c. log log n d. O(n2) 11.The number of all possible languages IEl based on alphabet E is c. log log rn d. (n') 12. Which of the following languages is not recognizable by a DFA or PDA a. E* b. 0* C. 0k1k d, witw 13. A function fis a correspondence if it is a. onto b. one-to-many c. many-to-many d. one-to-one and onto 14. A turing machine cannot a. write over the input b. write past the input c. move right after reading the first input symbol d. move left after reading the first input symbol