What is the order-of-growth of the algorithm below? public static int count (int[] a) { wwwwwwww wwwwww int n = a.length; wwwwwwww wowwwww wwwwww // assume sort happens in ~n*lg n Arrays sort (a); www wwwwwww // assume array contains no duplicates int count = 0; wwwwwww for (int i wwwwww } wwwwww = 0; i < n; i++) { int j = Arrays.binary Search (a, -a[i]); www www if (ji) count++; mm return count; wwwwwwww }