Donna often travels around the world. when she travels, she needs to access her emails from different locations. however, to keep her luggage light, she does not carry her laptop. which email program can donna use?
a. firefox mozilla’s thunderbird
b. yahoo! mail
c. microsoft outlook express
d. apple mail

In this problem, we want to determine a set of states with the smallest total population that achieves an electoral college win. specifically, for each state i, for i = 1, 2, . . , n, let pi be its population and vi its electoral votes. all electoral votes of a state go a single candidate, and so the (overall) winning candidate is the one who receives at least v = b( p i vi)/2c + 1 electoral votes. our goal is to find the set of states s for which p i∈s pi is as small as possible subject to the constraint that p i∈s vi ≥ v . design a dynamic programming algorithm for this problem; prove its correctness; and analyze its time complexity.