Determine whether language is regular using pumping lemma.

The alphabet is E = {a,b,c,d} Is the below language L regular or nonregular? If L is regular give a regular expression that denotes it. If L is non-regular, prove that it is non-regular using the pumping lemma. L = {azi bk | i >k>0} {b^c3y | x > 0, y >0}