There is no derivation for the given string.
This is proven by observing that every string in the grammar ends with an 'e'. This is easily verifiable from observing that 'A' is either recursive or leads to 'E', similarly for 'B' (doubly recursive).
The only derivation containing only terminals is 'E -> e' This means that every string must end in an 'e'. This also implies that every 'E' must eventually derive an 'e'.
Does anyone know how to derive
"aababb" from the following
A -> a E | b A A
E -> a B | b A | e
B -> b E | a B B
Well if that's the case, the string is derivable if and only if the start symbol is E:
E -> aB -> aaBB -> aabEB -> aabB -> aabaBB ->aababEbE ->aababb
It is not derivable if the start symbol is B because there will be an incorrect number of B's derived no matter what derivation is taken. And 'A' just won't work.