Create a finite state machine that recognizes the input strings tar, art, and rat by outputting a 1 (otherwise output 0). The input alphabet is {a, r, t}. The output alphabet is {0, 1}. The input stream may be any length, beginning with any arbitrary sequence of the input alphabet. The FSM should be completely specified. The FSM must include both inputs and outputs for each transition. The state transition tables should specify both outputs and next states. The FSM should not terminate. The FSM should recognize overlapping tokens (input strings). a) Draw the FSM. b) Create the state transition table. c) What is the sequence of states your FSM will go through when the string ttraartaratt is input?