The UTM (universal Turing machine) operates with a fixed alphabet. We claim that the UTM can simulate any Turing machine, but the Turing machine (to be simulated) may have an input alphabet (for example the Greek alphabet) and an output alphabet (for example the English alphabet) which are different than the UTMs alphabet. 1 Explain how a string over can be converted to a string over the UTMs alphabet, a process we can call CODING. 2 Explain how a string over UTMs alphabet can be converted to a string over , a process we can call DECODING. 3 Explain how CODING and DECODING can be carried out by VERY SIMPLE Turing machines