PLEASE PROVIDE ANSWER ON PAPER BY DRAWING STATES !!!

(30 pt., 10 pt. each) Construct a DFA in JFLAP (version 7.1) that recognizes each of the following languages. For each language, you must submit one JFLAP file clearly labeled (e.g., 1a.jff). Make sure that you test your DFAs in JFLAP before submitting. a. A={w{a,b}w does not end in ab} b. B={w{a,b} every a in w is followed by at least one b} c. C={w{a,b}w contains at most two a's and at least two b's }