C Drive: Design a DFA which will accept all the strings ending with 00 over an alphabet {0, 1} and write a program to implement the DFA.
![Construction of the machines that produce 'A', 'B', or 'C' if input ends with '1', '0', or nothing - GeeksforGeeks Construction of the machines that produce 'A', 'B', or 'C' if input ends with '1', '0', or nothing - GeeksforGeeks](https://media.geeksforgeeks.org/wp-content/uploads/20190224131336/k41.jpg)
Construction of the machines that produce 'A', 'B', or 'C' if input ends with '1', '0', or nothing - GeeksforGeeks
![SOLVED: Exercise 7.4.3: Identifying the set of strings accepted by an FSM: About Start Start 1,0 FSM FSM 2 Give the final state of each FSM after each input string below That SOLVED: Exercise 7.4.3: Identifying the set of strings accepted by an FSM: About Start Start 1,0 FSM FSM 2 Give the final state of each FSM after each input string below That](https://cdn.numerade.com/ask_images/8af4b00cef844613aa197fbbf54aaaa4.jpg)