1. Consider the context-free grammar with the rules (E is start variable) F-(E) Give parse tree and leftmost derivation for each string a) a b) alaxa ) d) (ata) x (ata)ta