two thieves steal a necklace with n beads of cost c1, c2, . . . , cn and want to divide them evenly (the same cost). (a) prove that this problem is np-complete assuming that all ci are integer. (b) suppose that there are only two types of beads. either give a polynomial-time algorithm, or prove that the problem is np-complete.
