12. (10 points) Consider the following algorithm. // Assume that n is a positive integer (=i.e. n > 1), and A[1..n] is a global array. // Note that the index of array A starts from one, not zero. // And also, don't forget the array A in the algorithm is global. Algorithm DoSomething (n) 1. if (n = 1) 2. print the current content of the whole array A on the screen; 3. else for it 1 to n do DoSomething(n-1); // Recursive call. 6. if n is odd swap A[1] and A[n]; else swap A[i] and A[n]; 10. return; Do i tvoro (a) Present execution result of the algorithm where an array A has "5 and n is 1. (6) Present execution result of the algorithm where an array A has "5, 7'and n is 2. (c) Present execution result of the algorithm where an array A has 5, 7, 9 and n is 3