Q. Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.

• (A) Assertions (a) and (b) are both true.
• (B) Neither (a) nor (b) is true.
• (C) Both False
• (D) None of above