Work Problem 2. (45 points) Question 12 Not yet answered Marked out of 45.00 P Flag question Consider the finite state machine given below in the state table form. Present State Output Next State Present Input 0 1 So S S2 S S; S, O O O O S2 S2 S; S; SA S; SA 1 SA SA (a) [15 points] Draw the corresponding state graph representation of the machine (b) (15 points] Give a regular expression for the set of input strings recognized by the finite state machine. (e) [15 points) If there exist, give three strings, of length 5, 8 and 11, that are recognizable by the finite state machine