Please help with this

Question 4 The task is to define a Turing machine which computes the function f: NAN, 2 if n 0 o if n=1 n if 2 f(n) You need to follow the definition in the lecture regarding how the inputs to a Turigmachine are (i) Describe informally how such a Turing machine can be defined and describe how it operates. 6 marks) written and how the result obtained by a Turing machine is interpreted ii) Formally introduce this Turing machine. You can use the graphical representation as intro- duced in the module. 12 marks] Hint: Note that the input is a binary number in normal form, which means it has no leading zeros (except for 0) Question 4 The task is to define a Turing machine which computes the function f: NAN, 2 if n 0 o if n=1 n if 2 f(n) You need to follow the definition in the lecture regarding how the inputs to a Turigmachine are (i) Describe informally how such a Turing machine can be defined and describe how it operates. 6 marks) written and how the result obtained by a Turing machine is interpreted ii) Formally introduce this Turing machine. You can use the graphical representation as intro- duced in the module. 12 marks] Hint: Note that the input is a binary number in normal form, which means it has no leading zeros (except for 0)