Please answer part B only. (If you do not have JFLAP, I do not mind a hand drawing because I am just trying to understand the logic)

2. we present here a series of FAs where the author of each FA has made an incorrect claim about the language it recognizes. For each FA, we list the file name where the FA is stored and the claimed language it recognizes. For each FA you must: (i) Produce six strings that are either in the indicated language but are not accepted by the FA, or that are accepted by the FA and are not in the language; simulate these strings on the FAs as well. (ii) Modify the FA so that it actually recognizes the language we claim it does. (iii) Simulate those six strings again to show that they are now either accepted or rejected if they either are or are not in the language respectively. It helps to use the fast simulator so that your test strings are saved from (i) to (iii). (a) The FA in ex1.6a recognizes the language of any string over the alphabet ? = {a,b} with exactly two bis. D) The FA in ex1.6b recognizes the language of any string of a's of some length divisible by 2 or 3