Consider the following languages over the alphabet $=\{a,b,c\}.$ If they are regular find a regular expression that defines the language. Otherwise, prove that thay are non$-$regular using pumping lemma.

i$)L1=\{a^{2n}{b}^{m}c|n,m0\}$

ii$)L2=\{a^{2n}b{c}^n|n0\}$