1. recast the decision problem for the boolean expression (p+q+~r)(p+~q)(r) as a subsetsum problem using the construction discussed in class. indicate what rows would need to be chosen for a solution. 2. recast the subsetsum problem {7, 17, 4, 11, 6, 2, 7}, g=36 as a partition problem using the construction from class. indicate what values need to be chosen to equal 36 for the subsetsum problem. indicate the partitions that evenly divide the partition problem you posed. 3. recast the decision problem for the boolean expression (p+q+~r)(p+~q)(r) as a 0,1-integer linear programming problem using the construction discussed in class. indicate what binary (0,1) values of p, q, and r give rise to a solution to the integer linear programming problem you posed.