int elements[] = {9, 0, 3, 5, 7, 2, 1, 8, 3, 7, 6}; int x[] = new int[10]; for(int i = 0; i < elements.length; ++i) { x[elements [i]]++; } //Point-A int i = x.length - 1; int j = elements.length - 1; while(i >= 0) { if(x[i] != 0) { elements[j] x[i]--; = i; j--; } else { i--; } } //Point-B What does array x look like at point-A in the code (you need to list all values in array x)? What does array x look like at point B (you need to list all values in array x)? What does array elements look like at point B (you need to list all values in array elements)? Is this a sorting-in-linear algorithm? Why or why not? Given integer array [12, 1, 9, 8, 9, 6, 5, 6, 4, 9, 2, 12,0], please list all values in array X (before sorting) by using the stable version of Counting Sort.