Given the following grammar G4, use JFLAP to determine for each of the following ten test strings if we L(G4) or w& L(G4) a, a, b, aa, ba, abab, a, ababba, b?, (ab) G4: S aSb | aSabSa bSb la ) State whether or not G4 is a regular grammar and explain why. 1) Determine if G4 is ambiguous and explain why. ) Precisely define L(G4) using a regular expression