4. (12 points) Consider the following code: public static void ss(int[] list) ( int mi, tmp: for (int i = 0; i < list.length - 1; 1++) { m1-1; for (int j 1+1; j < list.length; j++) { if (list (ni) > list [j]) { mi-ji tmp-list [i]; list [1] list [mi]: list [mi] tmp: 1 (a) (8 points) Suppose list [27, 10, 8, 19]. What happens when ss(list) is invoked? Show memory diagrams to explain what is going on in this method. (b) (4 points) Suppose list has n elements. Analyze the asymptotic running time ("Big Oh") of this method, in terms of n. Explain your reasoning.