Consider the language F = {a'b'c i, j, k 0 and if i = 1 then j = k}. a. Show that F is not regular. b. Show that Facts like a regular language in the pumping lemma. In other words, give a pumping length p and demonstrate that F satisfies the three conditions of the pumping lemma for this value of p. c. Explain why parts (a) and (b) do not contradict the pumping lemma.