Q$1$ If a PDA recognizes a language $L$

$1$ Point

then there is also a PDA that recognizes $L,$ and accepts strings only when its stack is empty.

true

false