Why can pushdown automata recognize more languages than finute$-$stare automata?

A$)$ A pushdown automaton ut:lizes a stack as a way to remember what came previously in the inpur.

B$)$ A pushdown automaton can change the characters in the input.

C$)$ A pushdown automaton has more final states than a finite$-$state automaton bas.

D$)$ Pushdown autotnata are always noedeterministic, finute$-$state automata are always determunustic.

E$)$ A pushdown automaton utilizes a queue to determurse which state to move to next