The language $L=\{a^i{b}^i|i>0\}($the set of non$-$empty strings which start with $a^{\text{'}}\text{'}$s and end with an equal number of $b\text{'}$s$)$ can be recognized by a Non$-$deterministic Pushdown Automata $($NPDA$)$ accepting by empty stack.

$$ True

$$ False