7. Write down a Regular Expression for the language L consisting of all binary strings where every non- empty block of Os has even length and every non-empty block of 1s has odd length (Notice that the empty string is in this language.) 8. Suppose that S-A, B,... .F} is a set of states and T- O-0, 1) are the input and output alphabets for the Mealy machine described by the transition table below. (a) Construct a state diagram for this Mealy machine. (Layout the states so that there is no need to have transition arrows crossing each other.) TransitioOutput 0 1 01 (b) Find the output string corresponding to the input string 0101011010011', when starting in state A. In which state does the machine finish? (c) Design a Moore machine which produces the same output as the Mealy machine in the previous question. In removing any inaccessible states, discuss which state or states are valid as the initial state; choosing that which keeps the total number of states to a minimum, if this is possible