1) Write a program in S(using macros freely) that computes the function f(x) 3x. 2) Let f(x) be the greatest number n such that n2. Write a program in computes f. that 3) Let SD be the program of [B] X-X-1 1F Z # 0 GOTO A write out a computation go of beginning with the snapshot (1, ), where consists of the equations X = 2, Y = 0, Z = 0 4) Let be the program [A] IF X2 0 GOTO E GOTO A l1, l2 , l3 As indicated, we are permitting each program to be used with any number of inputs. If the program has n input variables, but only mn the extra input values are ignored 5) Show by constructing a program that the predicate X1 21s computable 1) Write a program in S(using macros freely) that computes the function f(x) 3x. 2) Let f(x) be the greatest number n such that n2. Write a program in computes f. that 3) Let SD be the program of [B] X-X-1 1F Z # 0 GOTO A write out a computation go of beginning with the snapshot (1, ), where consists of the equations X = 2, Y = 0, Z = 0 4) Let be the program [A] IF X2 0 GOTO E GOTO A l1, l2 , l3 As indicated, we are permitting each program to be used with any number of inputs. If the program has n input variables, but only mn the extra input values are ignored 5) Show by constructing a program that the predicate X1 21s computable