Give a simple description of the language generated by the following context-free grammar: S aSb|bSa|SS| and prove that it does in fact generate that language. Once you know the language, the following hint may help with the proof: Let x be a string in the language. Prove that the shortest (non-empty) prefix of x that is also in the language cannot begin and end with the same symbol