Where D is decideable and SD is semi-decideable

True or False. Briefly explain. (a). Every infinite language has a subset that is not in D. (b). If -H were in D then every SD language would be in D. (c) {<M> (M) is context free} is in D. (d) {<M : (M) is not context free) is in D. (e). If L is reducible to L, and LE D then L E D. Show transcribed image text True or False. Briefly explain. (a). Every infinite language has a subset that is not in D. (b). If -H were in D then every SD language would be in D. (c) { (M) is context free} is in D. (d) {

## Expert Answer

Answer to True or False. Briefly explain. (a). Every infinite language has a subset that is not in D. (b). If -H were in D then ev…