We say that a DFA M for a language A is minimal if we cannot construct another DFA M' for A such that M'has fewer states than M. Suppose that M = ,,,0,F) is a minimal DFA for A. Then, we can construct a DFA M for A where M = (0,5,8,9, Q-F). Prove that M is a minimal DFA for A