How to prove the language if a language is context free Language without using Pumping Lemma?

Assume there exist languages: L₁={ 1^a0^a2^b1^b | a>0,b>0} and L₂={ 1^a0^a2^a1^b | a>0,b>0}.

1. Prove one of them is context-free by applying a context-free grammar that defines this language

2. Prove another is not context-free by using closure properties of context-free and regular languages.

Do not use pumping lemma!