Note Diagrams and execution traces may be scanned, but everything else must be typed

(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 1 11 12 15 5 a