.Consider the following recursive definition of a set S of strings. 1. Any letter in {a,b,c) is in S; 2. If x ∈ S, then xx ∈ S: 3. If x ∈ s, then cx ∈ S Which of the following strings are in S? A) ba B) a C) ca D) cbca E) acac F) X G) cb H) cbcb I) cba J) cbccbc K) aa L) ccbccb M) ccaca N) Occb
