LIFE 121 Chapter 22.1-22.2: 22.1-22.2

35. (2 points) Write a method/function named fact that computes n! (n factorial). Recall that n! is nx (n-1)(n-2)... x 2x1 for n greater >0 and ! is 1. You can assume your method is only passed non-negative values of n.

35. What does the following program print? int( data = {10,20,30,40,50); for (int i = data.length-2; i >= 0; i--) { data[i+1] = data[i]; for (int i = 0; i < data.length; i++) { print (data[i] + " "); A. 10 20 30 40 50 B. 50 40 30 20 10 C. 10 10 20 30 40 D. 20 30 40 50 50 E 10 20 20 30 40

35. Why do we check on line 20 of code 5 that nodel is not equal to node2? N.B. reread the header of this section. (A) To check if nodel is neighbour with node2 (B) It serves no real purpose (C) The code is wrong is should be if (nodel == node 2) (D) We want to make sure that we do not connect a node to itself (E) To avoid an infinite loop