Answer

Correct Option: (ii) An infinite tape

Explanation

Turing Machine model: $M = (Q,\Sigma,\Gamma,\delta,q_0,B,F)$ with

• Finite control (states $Q$),
• One infinite tape divided into cells, each holds symbol from $\Gamma$ ($\Sigma \subset \Gamma$), extends infinitely in one direction (or both in some definitions), with a read/write head.
• Initially tape contains input $w$ + blanks $B$ to the right (infinite blanks).

It does not have a stack (that's PDA) or queue as primary memory, nor finite tape (that would be LBA / finite automaton).

Final Answer

TM has an infinite tape → Option (ii).