1. Let S = {a,b}. Let M be the DFA a a b 91 93 a b b b start 90 92 94 Da,b Using the minimalization algorithm for DFAs, give a minimal DFA (with as few states as possible) that accepts the same language as M. Give the table for the minimalization algorithm. Draw the resulting DFA and label the states so that it is clear which states were merged