1. To transform the following NFA to a regular expression, we first connect a new start state s to the start state of the given NFA and connect each final state of the given NFA to a new final state f as follows. If we eliminate state 0 first, the modified NFA becomes of the following form. Fill out the blanks in the following figure. ( 6 points) If we eliminate state 1 then, we get the following NFA. Fill out the blanks below (only the new blank will be graded). (2 point) By eliminating state 2 we get the following NFA. Fill out the blanks below (only the new blank will be graded). ( 2 point). By combining the two edges between state S ad state f, we get the following oneedge NFA. Fill out the blank below. (1 point) After simplification, the expression becomes of the following form which is the regular expression of the given NFA (2 points). Expression of the NFA given in Question \#1 is