Question 5: Build Finite Automata with output for languges given below [10 Marks) (a) Build Moore machine for language L defined over 2 = {0,1), where l is printed if even number of l's is found in the input string and 0 is printed if odd number of I's is found in the input string. Once you build the machine process the input string 11001101 and show the output produced by the machine. (b) Build Mealy machine for language defined over input = {0, 1), that prints 'A' if the input string is termined by 00 and prints 'B' if the input string is terminated by 11. 'C' is printed otherwise. Process the following input strings and show the output. i. 1110100, ii. 1011011, iii. 101010