write program in java

Two Operations Problem Description Given an array A of length N Select any value from an array A and change to any other integer value You can do the above operations no more than 2 times. You can create another array B which contains an absolute difference of all the pairs of array A. Your task is to minimize the sum of largest and smallest values in an array B. Return the sum of largest and smallest value. Problem Constraints 3<>