12. Consider the following CFG that generates sequences of letters:

S -> a X c X -> b X c X -> b X d X -> b X e X -> c X e X -> f X X -> g

a. If you had to write a parser for this grammar, would it be more efficient to use a top-down or bottom-up approach? Explain why.

b. Trace the approach of your choice on the input bffge.