HW 5.  due Nov 2 in class.

1.  Problem 1 of Ch 7, KT.

2.  Problem 5 of Ch 7, KT.

3.  Problem 9 of Ch 7, KT.

4.  How long does it take to find a matching using the Ford-Fulkerson
algorithm?

5.  Problem 22 of Ch 7, KT.

6.  Read solved exercise 2 of Ch 7, KT.  Suppose now there is an
additional requirement.  As a part of the input you are told which
doctors are senior and which are junior.  You are given an additional
number S, and the requirement is that a senior doctor must be assigned
on at least S vacation days.

Dont worry about the number of problems -- all are quite simple.