1. You are given an array of n distinct integers.
2. You have to divide these n integers into k non-empty subsets such that sum of integers of every
subset is same.
3. If it is not possible to divide, then print "-1".
Note -> Check out the question video and write the recursive code as it is intended without
changing signature. The judge can't force you but intends you to teach a concept.Input Format
A number n n distinct integers A number k
Output Format
Check the sample ouput and question video.
Constraints
1 <= n <= 20 1 <= arr[i] <= 100 1 <= k <= n
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
6 1 2 3 4 5 6 3
Output
[1, 6] [2, 5] [3, 4]