I have already completed #1, but I'm VERY stuck on B and C.

1. (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 labelled (e.g., 1a.jff). Make sure that you test your DFAs in JFLAP before submitting. a. L1 = {w {0,1}* | every 0 in w is followed by at least one 1} b. L2 = {w E {a, b}* | w contains at most two a's and an even number of bs} c. L3 = {w {0,1}* | w is a binary number divisible by 3} Hint: for example, 1001 (9 in base 10) is divisible by 3 so it would be accepted, while 1010 (10 in base 10) is not divisible by 3 so it would be rejected. Leading O's (e.g., 001001) are allowed and the empty string is considered a representation of 0