Consider the following context-free grammar: G rightarrow G B rightarrow G N rightarrow elementof B rightarrow (E) E rightarrow E (E) rightarrow elementof N rightarrow (L] L rightarrow L E rightarrow L (rightarrow elementof (a) Describe, in English, the language generated by this grammar. (Your description should be a high-level characterization of the language one that is independent of the particular grammar chosen.) (b) Give a parse tree for the string ((] (). (c) Give a canonical (rightmost) derivation of this same string