Given the two NFA's below, add whatever is needed to the diagram to accept the concatenation of the languages accepted by NFA-4 and NFA-5. Accept states are indicated in the original machines by a double circle. Indicate accept states in the final combined machine by blackening in the double circle.

7) Given the two NFA's below, add whatever is needed to the diagram to accept the concatenation of the languages accepted by NFA-4 and NFA-5. Accept states are indicated in the original machines by a double circle. Indicate accept states in the final combined machine by blackening in the double circle, ie: B)) This state is no longer accepting B This state is now accepting 0 0, 1 0, 1 NFA-4 NFA-5