Question: a bbounded pda pushdown automaton is a pda m such...

A B-bounded PDA (pushdown automaton) is a PDA M such that it crashes whenever its stack height reaches B. Show that the language {0ⁿ1ⁿ : n ≥ 1} can not be accepted by a B-bounded PDA for any B.