Let $\backslash$Sigma $=\{0,1\}.$ Is the following language context$-$free? Prove your answer.

L $=\{0^$m$1^$n$|$ m $<2^$n$\}$

If it context$-$free, provide a context$-$free grammar. If it is not, provide a proof by contradiction using the pumping lemma