2. Show a (i) parse tree, (ii) left most derivation and (ii) right most derivation for the following unambiguous Grammar: Here, S can be called as a Start variable which is related to A, B, where A and B are other variables which yield terminal symbols like| a, b. [Note: Please consider a sample string w= aaabbabbba, and write down the left derivation, right derivation and parse tree required to construct this string w ] SaBbASaSbAAaBbSaBBb