Bonnie and clyde have just robbed a bank. they have a bag of money and want to divide it up. for each of the following scenarios, either give a polynomial-time algorithm, or prove that the problem is np-complete. the input in each case is a list of the n items in the bag, along with the value of each.
a. the bag contains n coins, but only 2 different denominations: some coins are worth x dollars, and some are worth y dollars. bonnie and clyde wish to divide the money exactly evenly.
b. the bag contains n coins, with an arbitrary number of different denominations, but each denomination is a nonnegative integer power of 2, i. e., the possible denominations are 1 dollar, 2 dollars, 4 dollars, etc. bonnie and clyde wish to divide the money exactly evenly.
c. the bag contains n checks, which are, in an amazing coincidence, made out to "bonnie or clyde." they wish to divide the checks so that they each get the exact same amount of money.
d. the bag contains n checks as in part (c), but this time bonnie and clyde are willing to accept a split in which the difference is no larger than 100 dollars.