What is meant by PDA acceptance by empty stack in Theory of Automata and Formal Languages?

Correct Answer: A

input is accepted when the stack becomes empty under the acceptance rules

The correct answer is input is accepted when the stack becomes empty under the acceptance rules.