(a) Show that the following language is Turing-decidable: L = {(M, x) | M eventually changes a space character to a non-space character on input x} (b) Let # be a special tape symbol (distinct from 0, 1, or the blank symbol). Show that the following language is not Turing-decidable: L = {(M, x) | M eventually changes a space character to # on input x} (a) Show that the following language is Turing-decidable: L = {(M, x) | M eventually changes a space character to a non-space character on input x} (b) Let # be a special tape symbol (distinct from 0, 1, or the blank symbol). Show that the following language is not Turing-decidable: L = {(M, x) | M eventually changes a space character to # on input x}