![4. [20 points] For any fixed integer k > 2, the k-PARTITION PROBLEM (abbreviated ‘k-PP) is: given a sequence of positive int](https://media.cheggcdn.com/media%2F7e6%2F7e6814db-ffdb-41bf-8b43-1ee7d73233ed%2FphpF1OkSO.png)
4. [20 points] For any fixed integer k > 2, the k-PARTITION PROBLEM (abbreviated ‘k-PP’) is: given a sequence of positive integers (w, w2,… ,wn), is it possible to partition them into k groups having equal sums. More formally, is there an n-vector h each of whose entries is a integer in the range 1,…, k such that, for each 1SjSk: wis Eh where h l-i hli j. For example, (1,2,1,3,1,1) is a “yes” instance
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured