Given an array a of N distinct numbers, write a function to count the number of ordered pairs of Indices such that I+), OSIJSN and a[0+a[1==min(a)+max(a) L.e. the sum of those two numbers equals the sum of both the minimum and maximum numbers in the array a. For example: a] = {1,2.6,3,4,5) Output= 2 Explanation: min(a)=1 and max()=6 2+5 = min(a)+max(a) and 3+4 = min(a)=max(a) Note: You can define other helper functions upon need. + tion Given an array a of N distinct numbers, write a function to count the number of ordered pairs of indices is such that it), OSIJSN and a[1]+a0]==min(a) + max(a) te the sum of those two numbers equals the sum of both the minimum and maximum numbers in the array a. For example: a[1 ={1.2.6,3,4,5) Output 2. Explanation: min(a)=1 and max()-6 2+5 = min(a)+max(a) and 3+ - min(s) +mara) Note: You can define other helper functions upon need