Input sequence consisted of the repeating patterns of “01” like “ XXXXXXXXXX..” is fed into a finite state machine (FSM). Construct a state machine (specifying the initial state and the state...

Input sequence consisted of the repeating patterns of “01” like “1010010101..” is fed into a finite state machine (FSM).

Construct a state machine (specifying the initial state and the state transition diagram) such that the infinite sequence as “babaabbaabbaabba.…” will be yielded as the output, or argue that it is impossible to yield such output.

Detailed answer please!