1.) What is the tightest asymptotic time complexity for this algorithm?

2.) Give at least two advntages for this algorithm.

3.) Give at least three drawbacks to this algorithm

There is data to be sorted in an array, A, of 3 digit numbers (n of them), all of which are distinct (no number is repeated) and fall in a range p.q. For example, all numbers might be between 300 and 400 Here is a sorting algorithm public static void mySort(int[] A, int p ,int q) int[] scratch - new int[q-p+2] for (int = 0; 0){ A[counter] scratch[i]; counter++; What is the tightest asymptotic time complexity for this algorithm