Exercise 3: Using JFLAP We present two 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 but not in the language. ii) simulate these strings on the FAs as well. ii) Modify the FA so that it actually recognizes the language we claim it does, iv) Simulate these strings again to show that the FA now rejects (resp. accepts) the strings it is supposed to. (a) The FA in ex1.6a recognizes the language of any string over the alphabet 2- (a,b) with exactly two b's (b) The FA in ex1.6c recognizes the language of any string over - (a,b.c) with at least 3 b's or at least 3 c's