Reading assignment:
Sections 4.5 of Chapter 4, 10.1 & 10.2 of Chapter 10, and 12.1 of Chapter 12 ( = Sections 3.6 of Chapter 3, 9.1 & 9.2 of Chapter 9, and 11.1 of Chapter 11 of 5th Ed.)

Written assignment:

1. (4 points) Prove correctness of the follow recursive algorithm to compute aⁿ :
         procedure power( a non-zero real, n non-negative integer )
         if n = 0 then return 1
         else return a*power(a, n-1)

   ( = Ex. 15 of Sect. 3.5, page 283 of 5th Ed.)

2. (4 points) Exercise 13 of Sect. 4.5, page 328 ( = Exercise 13 of Sect. 3.6, page 290 of 5th Ed.)
3. (2 points) Exercise 8 of Section 12.1 page 794 ( = Exercise 6 of Section 11.1 page 749 of 5th Ed.)
4. (2 points) Exercise 20 of Section 12.1 page 795 ( = Exercise 14 of Section 11.1 page 749 of 5th Ed.)
5. (3 points) Exercise 21 of Section 12.1 page 795 ( = Exercise 15 of Section 11.1 page 749 of 5th Ed.)