2. Array Reduction. There is an array of n integers called num. The array can be reduced by 1 element by performing a move. Each move consists of the following three steps: 1. Pick two different elements num[l] and num[i], i≠j. 2. Remove the two selected elements from the array. 3. Add the sum of the two selected elements to the end of the array
