Consider the language {ww | w element {a, b}*}. Show it is not regular via Pumping Theorem Show it is not regular via the Mayhill NE rode theorem Show it is not Context-free via Pumping. Show that any DFA M = (K, sigma, delta, s, F) accepts an infinite language if it accepts some string w with | w | > | K|. Similarly show that a CFG G = (V, sigma, R, S) generates an infinite language if it generates a string longer than fan-out^|v| - where for grammar G its fan-out = Max {|w|; A rightarrow w element R}, the maximal length of the right-hand sides of rules