Which of the following grammars derives a subset Ls of the language: L= {x | (i) x contains a and c in proportion 4:3, (ii) x does not begin with c and (iii) there are no two consecutive c's} such that Ls is missing at most a finite number of strings from L.

a) S acacaca, S , S SaScSaScSaScSaS

b) S acacaca, S SaScSaScSaScSaS, S SaSaSaScSaScSa

c) S , S SaScSaScSa

d) S , S SaScSaScSaSaSaS

explain me plz