There is an array, A, of numbers (n of them) to be sorted. All numbers are distinct (no number is repeated) and fall in a range p... The smallest and largest possible numbers are known and are input as part of the algorithm. For example, all numbers might be between 300 and 400. Here is the sorting algorithm: public static void mySort(int[] a, int p ,int q) { int[] scratch = new int[a-p+1]; for (int i = 0; i 0) { A[counter] = scratch[i]; counter++; } } What is the loop invariant of the first loop? b. Prove the correctness of the first loop at initialization, maintenance, and termination. What is the loop invariant of the second loop? d. Prove the correctness of the second loop at initialization, maintenance, and termination