Compilers: Given the following CFG:

S ? aB | bX

B ? bB | aX | ?

X ? bX | aX | ?

Draw the parse tree and trace using the left most derivation to determine whether the strings abbaab and babbaaa are accepted or rejected. Show your steps.

Thank you~!