5. (20 pts) Given the following grammar: 1: S - AB 3: B - TbBTT 4: T + aTbTbTaTe s is the start symbol and the token set is (a, b}. Symbol e represents the empty string. a. Describe the strings derived from T, A, and B respectively. What is the language generated by this grammar? b. Give a left-most derivation and a right-most derivation for the sentence abaa. c. Draw a parsing tree for the sentence abaa