Assume that the allowed strings in a toy programming language with alphabets > regular expression(x + y)*(x* + (yx)*). = {x, y} follows the (a) Identify the types of strings generated by the regular expression. Draw the Finite State Automata for the detection of the given expression. (b) Write the corresponding production rules (in CFG format) of the above machine. Derive two strings (of length 6) using the CFG you design. (c) Explain (in brief) the strategies to remove ambiguity from language grammar. Use example as needed.