Please answer #1

Group exercises 1. [10pt] (Submit a JFLAP file of your CFG and a print out on your HW auswers showing accepted/rejected strings) Give context-free grammars generating the following languages (5pt each]: (a) La = L1 U L2 , where L1 {a" b"crnd" : n, m > 0} and L2 = {anberr : n, m 2 0) where (w) is the number of occurrences of a in w