Let L = {w | w {a, b}* and w has twice as many a's than b's}

So, the CFG = S -> aSbSa | aSaSb | bSaSa | E (empty string)

QUESTION: how can we generate abbaaa from the language?

Please explain. Thanks!