5. In the process of transforming the following NFA to a regular expression, we first connect a new start states 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. 04Q. 040 If we eliminate state O first, the modified NFA becomes of the following form. Fill out the three blanks in the following figure. (6 points) If we eliminate state 1 and state 2 then, we get the following NFA. Fill out the two blanks below. (4 points) By combining these two edges we get the following NFA. Fill out the blank below (2 point). This is the regular expression of the given NFA