Finding maximum valued subset in which PartitionProblem algorithm returns true

Question

I´ve got the following assignment.

You have a multiset S with of 1<=N<=22 elements. Each element has a positive value of up to 10000000.

Assmuming that