For part 2 of your assignment, youll be creating a graph comprised of nodes and vertices that can take input strings, and use them to generate unique output. Each of the vertices in the graph indicates which path will be taken when receiving a given numerical input. Each node in the graph indicates the output to be displayed when given an alphabetical input. Note that for each of the provided input strings, youll begin in the Cat node.

PLEASE SEE THE ATTACHED GRAPH DIAGRAM.

INPUT STRINGS:

( 1 ) BB2AAB1A

( 2 ) 11B2A2B1B

( 3 ) A1BB1222A

( 4 ) 122A22AA1A

( 5 ) AA2AA2A22B

As an example, the input 1A1B21B would result in the output:

Lemons

Thud

Thud

State: Cat A: "Meow" B: "Ignore" Start in This State State: Food A: "Lemons" B: 11 Cinnamon 11 State: Noise A: "Boing" B: 11 Thud. 11