4. Consider the alphabet -ta,b,c, $, #} and let G be the following grammar, where S is the start symbol. E-a E-b a) Draw a parse tree for a#b#c. b) What is the associativity of the # operator? a) left b) right c) neither c) What is the associativity of the S operator? a) left b) right c) neither d) Which operator has higher precedence? a)# b) S c) neither e) Gis a) lelt recursive b) right recursive c) both left and right recursive d) neither left nor right recursive f) G is a) ambiguous b) not ambiguous