1) Use JFLAP to create and test a DFA accepting the language

a) L1 = {x | x {0, 1}* and x contains at least three 0s}. (Be sure that the machine is deterministic, i.e., has exactly one transition per state per symbol.)

b) L2 = {x | x {0, 1}*, x starts with 1, and x contains at most one 0}.

c) test an NFA that accepts (L1 L2).

d) M = ( {q1, q2, q3, q4},

{0,1},

{((q1,0),q1), ((q1,1),q2), ((q2,0),q3), ((q2,1),q4), ((q3,0),q2), ((q3,1),q1), ((q4,0),q3), ((q4,1),q4)}, q1, {q1, q4} )