(b) Prove that the following language over the alphabet I = {a,b} is non-regular. L = {bSp+43b p.9 N} Do not use the Pumping Lemma (a topic that has not been taught in this module). [5 marks] (c) The following is a partial DFA over the alphabet = {a,b}. Make it into a total DFA (using the algorithm taught in lectures), and then prove that what you have obtained is minimal. [5 marks] a a 10 13 14 b b b b b 11 12 15 a