Consider the language L of strings, defined over Σ = ,a,b-, ending in a?

(A) There are finite many classes generated by L, so L is regular
(B) There are infinite many classes generated by L, so L is regular
(C) There are finite many classes generated by L, so L is non-regular
(D) There are infinite many classes generated by L, so L is non-regular