Consider the given CFG:

S $->$aXaXa, X$->$aX$|$bX$|$null

What is the language this CFG generates?

Group of answer choices

None of the above

a language with all strings of at least $3$ a$\text{'}$s

a language with all strings that start and end with a$\text{'}$s with at least $3$ a$\text{'}$s

a language with all strings that start and end with a$\text{'}$s with at most $3$ a$\text{'}$s

a language with all strings of at most $3$ a$\text{'}$s

a language with all strings of a$\text{'}$s and b$\text{'}$s