Let L be the language over {a,b,c} accepting all strings so that: 1. All a's occur after the first c. 2. All b's occur before the first c. 3. The last symbol of the string is a. 4. There are exactly twice as many bs as as. Construct a context-free grammar generating L. You do not need an inductive proof, but you should explain how your construction accounts for each rule