The following algorithm segment makes change; given an amount of money A between 1e and 99c, it determines a breakdown of A into quarters (g), dimes (d), nickels (n), and pennies (p). 9 := A div(25) A := A mod(25) d:= A div(10) A := A mod(10) n:= A div(5) p:= A mod(5) (a) Trace this algorithm segment for A = 66. A = 66 9 = A = d = A = n = p = (b) Trace this algorithm segment for A = 86. A = 86 A = d = A = n = p =

Q10A. Consider the following algorithm: 81 = 3 82 = 8 for k > 2: gk = (k-1)·gk-1 - 8k-2 What is term g6 of the recursive sequence generated as a result of executing this algorithm?

13. a. Find the GCD of the following pairs of numbers using the Euclidean algorithm. (3360,4576) b. Find the LCM of the following pairs of the numbers. (144, 180)

Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note: You have to use some expressions more than once, but each box must contain only one of those expressions. procedure sum : positive integer) if then sum 1 else sum + sum