[2 points] Axiom Input Requirements 1 Point: JVM exits. 1 Point: Each of the following must be recognized as an error. The program must display an error dialog then return to asking for the input. To get this one point, all of these errors must be recognized: f= = ? [7 points] Rules Input Requirements 1 Point: JVM exits. The following must be recognized as an error. The program must display an error dialog then return to asking for the input: 1 point: f=f+1 1 point: f=f-h h=f+h 1 point: f=f-h;h f+h 1 point: f=f-h;f=f+h 1 point: f = f-h; f = f+h 1 point: ff= f-h; h = f+h [1 point] Generation Input Requirements 1 Point: Each of the following must be recognized as an error. The program must display an error dialog then return to asking for the input. To get this one point, all of these cases must be recognized: f 26 Additionally, JVM exits. NOTE: The robot check of buildString output has been moved to lab 6. For lab 5, all testing will be done through the dialog boxes. ONLY THE FINAL RESULTS must match. Showing each generation with a 1 second pause is not a requirement. For each of the known and unknown tests below, test by comparing image result with image result of instructor’s solution. If the images match, then student gets full points for the test. If the images do not match, then compare the returned strings. If the returned strings match, then student gets full credit. [4 points] (Example #1) axiom = "f" rules = "f=f-h; h=f+h" generation = "8" [4 points] (Example #2) axiom = "f" rules = "f=f-f-" generation = "8" [4 points] (Example #3) axiom = "x" rules = "x=f+f+f+f+;f=hh-hhx--hh+h--" generation = "7" [4 points] (Unknown #1) axiom = "BfRf" rules = "f = f - h; h = f + h" generation = "7" [4 points] (Unknown #2) axiom = "Rh" rules = "h=Bh+h-Rh-h+h" generation = "4" [5 points] The visual display works for each of