Given a finite state machine with input alphabet [a, b) output alphabet [0,1) that will recognize the substring abba. It outputs O's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings. The FSM does not terminate. The initial state is qo. a/0 a/0 b/0 b/o blo q1 a/0 b/o Current Output state Next state go 0 42 a) Draw the FSM's testing tree using the notation from Mathur's Example 5.11 b) What is the transition cover set for the FSM? Given a finite state machine with input alphabet [a, b) output alphabet [0,1) that will recognize the substring abba. It outputs O's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings. The FSM does not terminate. The initial state is qo. a/0 a/0 b/0 b/o blo q1 a/0 b/o Current Output state Next state go 0 42 a) Draw the FSM's testing tree using the notation from Mathur's Example 5.11 b) What is the transition cover set for the FSM