Yоu аre wоrking in the teаm оf one of the presidentiаl candidates of Computopia. They task you with the problem of determining a set of states with the smallest population that can provide the votes to win the elections. Your input is An array V of length n, where V[i] represents he number of electoral votes of state i. An array P of length n, where P[i] represents the population of state i. An integer Z>0, which represents the electoral votes needed to win. All electoral votes of a state go to a single candidate. Example: for input V=[5,1,2,7,6], P=[200,100,30,700,250] and Z=12, your algorithm should output 480 since states 1,3,5 together yield 5+2+6=13 votes. Note that V and P are not sorted, and it is possible that P[i]>P[j] and V[i]