5. Bob comes up up with a specific design of a DFA Mbob that recognizes L. Peter claims he has another design of a DFA Mpeter that also recognizes L, with a different number of states from the number of states in Mbob. Is this possible? If it is NOT possible, show that if Mbob and Mpeter both recognizes L, Qbobl = |Q peter). Otherwise, show that the following is true: If there is a DFA with n states that recognizes L, for any m> n, there exists a DFA with m states that also recognizes L