1. Array Subsets Given an integer array, divide the array into 2 subsets A and B while respecting the following conditions: The intersection of A and B is null. The union A and B is equal to the original array. The number of elements in subset A is minimal. . The sum of A's elements is greater than the sum of B's elements. Return the subset A in increasing order where the sum of A's elements is greater than the sum of B's elements. If more than one subset exists, return the one with the maximal sum. Example n=5 arr = [3, 7, 5, 6, 2] The 2 subsets in arr that satisfy the conditions for A are [5, 7] and [6, 7]: A is minimal (size 2) Sum(A) = (5 + 7) = 12 > Sum(B) = (2+ 3 + 6) = 11 Sum(A) = (6 + 7) = 13 > Sum(B) = (2+ 3+5) = 10 The intersection of A and B is null and their union is equal to arr. The subset A where the sum of its elements is maximal is [6, 7]. Function Description Complete the subsetA function in the editor below. subsetA has the following parameter(s): int arr[]: an integer array Returns: int[]: an integer array with the values of subset A. Constraints 1n105 1 arr[i] 105 (where 0