What is the tightest asymptotic time complexity for this algorithm? Name 2 advantages & 3 drawbacks of 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(intI] A, int p ,int q) ( intl] scratchnew int[q-p+2]; for (int 0; o) Alcounter] scratch[il; counter++; What is the tightest asymptotic time complexity for this algorithm