1. Consider the finite state machine whose next state function and output function are given by: and (a) Write out I and O. (b) Draw the state diagram (with starting state s0 ) (c) Which states are reachable from s3 ? (d) List any transient states if they exist. (e) List any sink states if they exist. (f) Determine any submachines, with I1=I, if there are any. (g) let w=100221. If w is the input string what is the output string and what state do you end up in? (h) Is y=00221 a transfer sequence from s2 to s5. Prove your answer carefully