(a) (10 points) Design a CFG that accepts the same language as the RE a* +(ab)* (b) (10 points) Design a CFG for language L={(01):21 {0, 1, 2}*[i, j >0} (c) (10 points) Construct a context-free grammar that generates all even- length strings of character a (e.g. aa, aaaa, etc) (d) [10 points) Construct a context-free grammar that could parse student records of the following format: [Ioanna, 99-123456, UNIC111] (Mark, 91-222222, UNIC9992323243] Note that: The first name is any sequence of characters, at least one character, no length restriction. The cell phone number starts with 9 and has 8 digits total. A hyphen is present. The ID number starts with UNIC, followed by a sequence of numbers, at least one number, no length restriction. Each student record is enclosed in square brackets. There is at east one student record in the file. You may use terminal character in your grammar to specify a single character. You may also use terminal digit to specify a single digit