i need help

can you help me very fast and i will rate you

its discrete math

Consider the finite state machine given below in the state table form. Present State Output 1 So 0 S Next State Present Input 0 S S2 S; S S2 Sz S. Sz S. S. 0 S2 0 S 0 S. 1 (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. (C) [15 points) If there exist, give three strings, of length 5, 8 and 11, that are recognizable by the finite state machine