a) Let M = {S, 1, 0, 9o, fs, fo} be the finite state machine of equipment Y. Figure 5 shows the transition diagram for the machine. b/0 b/O b/o a/1 A B b/1 a/o a/0 a/1 a/o F E D b/1 b/1 i. a/0 Figure 5 Construct the transition table with q. = A for the machine in Figure 5. (4 marks) What is the output string if the input string is aaabbbaa? (Show the sequence of configurations and its output) (2 marks) Is the input string abababba accepted by the machine? (Show the sequence of configurations and its output) (2 marks) ii. iii. b) Design a FSM with the input set {a, c, e, p) such that the machine accepts all strings that contain substring 'aceep'. (3/2 marks) c) Design a FSM that accepts all string over {x, y, z) that contain substring xy and end in (342 marks) XZ