Consider the given CFG:

S a X a X a , X a X | b X |

What is the language this CFG generates?

a) a language with all strings of at least 3 a's

b) a language with all strings of a's and b's

c) a language with all strings that start and end with a's with at most 3 a's

d) a language with all strings of at most 3 a's

e) None of the above

f) a language with all strings that start and end with a's with at least 3 a's