Design a fundamental mode asynchronous finite state machine that accepts input pair, A and B. The AB input sequence 00, 01, 11, 10, 11, 01 is assumed. Z = 1 output is produced on the last input (01) of the sequence. a. Develop the primitive flow table with a new stable state under each input for the giver sequence. For a given total stable state, assume other inputs (not in the sequence) are don't cares. b. Determine a reduced flow table to achieve the minimum number of feedback paths. c. Determine a state assignment for the feedback path(s) and show the reduced encoded flow table