Given the following DFA M ({A. B. C. D. E. F. G), {0, 1), , A. {A. E), where transition function is defined as follows: D C D E D G (a) Draw the state diagram for the given DFA (b) Using the algorithmic DFA minimization technique (not Myhill-Nerode), deter- mine distinguishable and indistinguishable states. Show your table that indicates distinguishability (or lack thereof) (c) Draw the state diagram for the minimal DFA for this language. Label your states so that it is clear which states were combined from the original machine