(a) (10 pts) State the definition of a Deterministic Turing Machine (DTM) M (1) deciding a language; (ii) semideciding a language; and (iii) computing a function : * (b) (15 pts) Let be an alphabet and let L be a language over the alphabet E. L is called a language of palindromes if for every wel: w = wol where wf denotes w written in reverse order. Construct a DTM either in tabular or graphical form that decides such a language L of palindromes