3. Consider these languages 

 L = {  | M is a TM and M accepts at least 117 different strings over {a,b,c}} 

 L = {  | M is a TM and M accepts at most117 different strings over {a,b,c}} 

a. Are L and L decidable? If one or both are undecidable, choose one and prove undecidable. 

b. Are L and L Turing acceptable (recurs enum.)? If one or both are acceptable, choose one that is; prove it.