For each part, show that the language is regular, or use thepumping lemma to show that the language is non-regular.
5. For each part, show that the language is regular, or use the pumping lemma to show that the language is nonregular. You must justify your answers to receive full credit. 30 points a) L-tor ljsi and i,j>0} b) Ls -ab’c li <j+k and i,j,k >0 e) 4 = {0,01,101} 0 L, 0110si.js3 Show transcribed
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured