Consider this Moore$-$type Finite State Machine represented by the state

transition diagram below.

Use binary encodings

a$.(8$ points$)$ Write the following:

i$.$ State encoding table

ii$.$ State transition table $($using state and input encodings$)$

b$.(2$ points$)$ Write the output table $($using state and output encodings$)$

c$.(2$ points$)$ Write Boolean equations for $($simplification optional$)$:

i$.$ The next state logic

ii$.$ The output logic

d$.(8$ points$)$ Sketch a schematic $($circuit diagram$)$ of the Finite State Machine. Problem $4.(20$ points$)$ Consider this Moore$-$type Finite State Machine represented by the state transition diagram below.

Use binary encodings

a$.(8$ points$)$ Write the following:

i$.$ State encoding table

ii$.$ State transition table $($using state and input encodings$)$

b$.(2$ points$)$ Write the output table $($using state and output encodings$)$

c$.(2$ points$)$ Write Boolean equations for $($simplification optional$)$:

i$.$ The next state logic

ii$.$ The output logic

d$.(8$ points$)$ Sketch a schematic $($circuit diagram$)$ of the Finite State Machine.