Homework 6
			due Mar. 21
			(hardcopy only, handwritten is fine)

Homework #6 is from Chapter 6.  Exercises:
  6.1, 6.2, 6.3, 6.4

NOTE:  The first four exercises can all be done using dynamic programming
with just a one-dimensional array.  Hence, these examples are most
similar to the Fibonacci example in class (which needed only a one-dimensaional
array).  Unlike the Fibonacci example in class, the recursion formula
is not given to you.  You must produce a recursion based on the given
word problem.  For an array x of length n, you will need a recursion that
describes how to compute x[i] in terms of x[1], x[2], ..., x[i-1].