For the language, use the Pumping Lemma to prove that it is not regular.

(b) L = {w|na(w) # no(w)} (Note: Here and elsewhere, na(w) means the number of a's in w.)