Problem 1 Construct NFSAs (or NFSAs with e-moves if you prefer) for the following languages 1. L,- (using only 1 state) 2. L2 = {010" | n 0} U {0101'n | m 0} with no more than five states (possibly only four) w {a, b}*, w contains any number of 'a', \ followed by any number of followed by one or more 'a' 3. L3 = with only three states Problem 2 Convert the NFSAs from Problem 1 into DFSAs using the procedure we have studied in class