Problems 16-4

a.

b. O(n).

Problems 16-3

Solution wanted!

Problems 16-2

a. Run the shortest task first.

b. Run the shortest elapsed time first.

Problems 16-1

a. See reference.

b.

c.

d. Dynamic programming. Let c(i) be the optimal solution for i. Then the recursive formula is .