Find the array element having minimum sum of absolute differences with all other array elements

Find the array element having minimum sum of absolute differences with all other array elementsGiven an array arr[] of size N, the task is to find the minimum sum of absolute differences of an array element with all elements of another array.Input: arr[ ] = {1, 2, 3, 4, 5}, N = 5Output: 3Explanation: For arr[0](= 1): Sum = abs(2 – 1) + abs(3 – 1) + abs(4 – 1) + abs(5 – 1) = 10.For arr[1](= 2): Sum = abs(2 – 1) + abs(3 – 2) + abs(4 – 2) + abs(5 – 2) = 7.For arr[2](= 3): Sum = abs(3 – 1) + abs(3 – 2) + abs(4 – 3) + abs(5 – 3) = 6 (Minimum).For arr[3](= 4): Sum = abs(4 – 1) + abs(4 – 2) + abs(4 – 3) + abs(5 – 4) = 7.For arr[0](= 1): Sum = 10.Input: arr[ ] = {1, 2, 3, 4}, N = 4Output: 2Approach: The problem can be solved based on the observation that the sum of absolute differences of all array elements is minimum for the median of the array. Follow the steps below to solve the problem:Sort the array arr[].Print the middle element of the sorted array as the required answer.Below is the implementation of the above approach:C++#include using namespace std;  void minAbsDiff(int arr[], int n){          sort(arr, arr + n);          cout