Implement the state machine you designed in the FSM Quiz to recognize strings of the form:
((ab)*c+d*)*
Use PROCs well to break your program into re-usable parts. (You should understand the value of modularization by this stage in your programming course-work/career, right? It will also serve you well when we learn to make our own 'link libraries'.)
This assignment is Level 3.
Add (Level 1) to print the current state as each character is processed. (Please name your states in a reasonable manner so they are recognizable!)