Assume that natural numbers 7 N are represented by strings 1" (where 1 = A). Remember that Turing machines compute multi-argument functions from a list of inputs separated by blanks. Consider the following Turing machine M which computes a binary partial function fu:NN N 90 A/AR 1/1 R 91 A/1 R 92 1/1 R 1/1 L 1/AL A/AL 94 93 A/AR 95 A/AL 97 1/1 L (i) (a) [2 marks] What is f(1, 1)? (b) [2 marks] What is fm (1,2)? (ii) [8 marks] Give the partial function f: NxNN. 1/1 R 1/1 R A/AS 96 ha