Use JFLAP to construct the DFAs and NFAs below. Test each machine using JFLAP Input Multiple Run. The alphabet for each problem is = {a, b, c}

1. Construct a DFA for L = all strings with a substring abb. Test Input: ccabbb, abbabbc, acbcbcabccabba, ababacc, bab , abbabbab, abcbb, a,b,c

2. Construct an NFA for L = all strings with the substring abcba . Test Input: abcba, cabcabcbabb, ababcba, ccabcaa, aabbc, ababa, cabccba