Question 3: Consider the function even(n)={1ifniseven0ifnisodd a) i) Prove that the even () function is primitive recursive. ii) As a result of i) above, evaluate, even(4). [(5)+(5)] b) Prove that the even function is Turing Machine computable [10]