Automata, Computability and Formal Languages CS 3350 spring 2020 L. Longpr Assignment 3, due 2/6/2020 in class Construct a regular expression for the language accepted by the following NFA, defined as (Q, 2,8,90, F) where 1. Q = {90, 91, 92, 93} 2. E= {a,b} 3. qo is the start state 4. F = {90, 93} a b {9} {92} 5. 8 is given by 91 . 92 {41} {90, 92} 93 0 {9} E {91} 0 0