Please write the code in C for the following finite state machine with given requirements:

Starting state is C

Requirements :

No Commands:

Before any commands are issued to your program, it should print out the starting state.

One/Zero Commands:

These commands (a `0' or a `1' on a line by itself) must print to stdout the name of the next state given the supplied input, and update the current state.

Change command:

The change command is invoked by the letter `c' followed by a `1' or a `0' followed by the name of a state (i.e. a single letter in the range AH). This command modifies the state machine such that the `0' (or `1') command applied to the current state will cause the machine to change to the named state and that this change is the state machine configuration will continue. This command should produce no output.

Print command:

The print command is invoked with the single letter `p'. It should print to stdout the state machine configuration as currently specified (i.e. including changes that may have been made with change commands) in the same format that your state machine was specified with.

Garbage Identify command:

This command is invoked with the single letter `g'. It should identify all states that are reachable or unreachable from the current state. It always produces output to stdout.

If all states are reachable, it should output No garbage. Otherwise, it should output

Garbage: where is the list of the state names that are no longer reachable.

Delete command:

This command is invoked with `d', optionally followed by the name of a state to delete. When the d command is invoked without the optional argument, it should delete (i.e. mark as deleted) all un-deleted states that are unreachable. If there are no such unreachable un-deleted states, it should print:

No states deleted.

Otherwise, it should print the message:

Deleted:

Example of the above state:

The description of a state machine is given in a text file where each line has the following format:

The is the name of the state being defined, is the name of next state if the input is `0'; and is the name of next state if the input is `1'. All state names are single uppercase letters.

For example, given the state machine description and the information that the initial state is `C':

A B C

B A A

C A D

D D C

The inputs and outputs :

0 0 0 0 0 0