PLEASE PROVIDE SOLUTION ONLY USING HEADER #include

Consider the finite state machine shown in Figure 1. This machine detects a sequence of characters that consist of zero or more A characters followed by a B and then a D, or the sequence ABD. These two patterns can be expressed using the notation (A*B | AC)D. The * symbol specifies zero or more occurrences and the | symbol specifies logical OR. For example, the following character patterns will be detected by the machine:

BD

ABD

AABD

AAABD

ACD

Write a program to implement the machine using the while()-switch() mechanism shown in class on Tuesday February 18. The circles represent machine states with the integer state value shown in the circle. To transition from one state to another where there is no character shown on an edge, perform an iteration of the while loop. If an edge has an associated letter, that character must be read using getchar() to transition states. Using the keyboard, enter several character patterns to verify detection. For example, typing the sequence CDAABCAAABDDACDAAC should report two pattern occurrences. Terminate the machine anytime EOF is read (i.e. ctrl-d).