A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals. S?aS?A A?aAb?bAa?? For the correct answer in Q75, how many steps are required to derive the string and how many parse trees are there?