Given a finite state machine with input alphabet fa, b) output alphabet 10,1) that will recognize the substring abba. It outputs 0's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings. The FSM does not terminate. The initial state is qo. a/o a/o b/0 b/0 q1 q.blo a/o a/ blo Current Next state /Output state 41 q2 93 91/0 91/0 91/0 q1/1 qo/0 q2/0 q3/0 qo/0 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 fa, b) output alphabet 10,1) that will recognize the substring abba. It outputs 0's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings. The FSM does not terminate. The initial state is qo. a/o a/o b/0 b/0 q1 q.blo a/o a/ blo Current Next state /Output state 41 q2 93 91/0 91/0 91/0 q1/1 qo/0 q2/0 q3/0 qo/0 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