5. In the process of transforming the following NFA into a regular expression, (10 points) start0 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 shown below. If we eliminate state 1 first, the modified NFA becomes of the following form. Fill out the two blanks in the following figure. If we eliminate state 2 then, we get the following NFA. Fill out the two blanks below. Finally, by eliminating state 0, we get the following NFA. Fill out the blank below. This is the regular expression of the given NFA