8. (15 points) Let A[0...n-1) be an array of n integer numbers. Assume that all the numbers are distinct. In the array, a pair of two numbers (A[i], 4[]) is called an inversion if i 46). (a) Assume that the array size is 4. What is the largest number of inversions possible in the array? Present a sample array with 4 integer values and describe your answer clearly. (6) Similarly, answer the same question for an array with 6 integer values. (c) Based on your answers to the question (a) and (b), what is the largest number of inversions in the general array with n elements