1) "Explain primal dual construction found at:
http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem. Is the dual correct?
2) Argue that the following prob is NP Complete. Given a list of positive integers, u1,u2,...un (in binary representation) and asked if there is a partition of this set into 3 subsets, each of which has the same sum.
3) Argue that the problem above is NP Complete if k>3 subsets are required in the partition.