Let S = {a,b}. Give a CFG generating the language of strings with twice as many a's as b’s. Prove that your grammar is correct.