1) True or false

a) Every regular language is decidable

b) Every finite language is regular

c) The empty language is decidable.

d) Some languages are decidable but not Turing recognizable.

e) There is a TM that recognizes the language of (TM M, input s) pairs such that M halts on s.

f) Every context free language is decidable.

g) The number of Turing machines is uncountable.

e) There is a TM that recognizes the language of (TM M, input s) pairs such that M loops on s.