P is a PDA that accepts a la nguage that is regular. Which of the following can be true of P no matter what that language is$?$

P will require fewer states than an equivalent NFA.

If P uses the stack, the depth required will be limited$.$

None of the other answers are correct.

P never has to use the stack.

For every string in L$,$ P will require fewer transitions than a DFA.