Show that the language F={a^ib^jc^k|i,j,k >=0 and if i = 1 then j=k} is not regular. Show, however, that it satisfies the statement of the pumping lemma as I proved it in class,i.e. there is a p such that all three conditions for the pumping lemma are met. Explain why this doesnt contradict the pumping lemma.

Question 3[20 points] Show that the language F = {aiBekli, j, k > 0 and ifi1 then j k } is not regular. Show, however, that it satisfies the statement of the pumping lemma as I proved it in class, i.e. there is a p such that all three conditions for the pumping lemma are met. Explain why this does not contradict the pumping lemma