Which of the following is true for a language L to be accepted by a pushdown automaton $($PDA$)?$

A$.$ L must be a regular language

B$.$ L must be a context$-$free language

C$.$ L must be a context$-$sensitive language

D$.$ L must be a recursive language