Discuss if the following languages are decidable:

1.S = {< M > | M is a TM that recognizes a CFL }

2.S = {< M > | M is a TM that recognizes a finite language }