# For each of the following languages either prove it is undecid-able using a reducibility proof or… For each of the following languages either prove it is undecid-able using a reducibility proof or show it is decidable by giving pseudocode for a TM that decides it: (a) Let FINITE_TM = {(M) | M is a TM and M accepts a finite number of strings} (b) Let ALL_TM = {(M) | M is a TM and M accepts every string} (c) Let H ALT_LBA = {(B, w) | B is an LBA and B halts on input w} (d) Let MORE_CFG = {(G_1, G_2) | G_1 and G_2 are CFGs where |G_1| < |G_2| (i.e., G_2 accepts strictly more strings than G_1} (e) Let EMPTY_CFG = {(G) | G is a CFG and G generates epsilon} Show that EQ_CFG = {(G_1, G_2) | G_1 and G_2 are CFGs where L(G_1) = L(G_2} is co-Turing-recognizable. A useless state in a Turing machine is one that is never entered on any input string. Consider the problem of testing whether a given state in a Turing machine is a useless state. Formulate this problem as a language and show that it is undecidable.