A. Suppose a is an array of size n, what is the time complexity (in big-O notation) of the following code? (EXPLAIN WHY)

for (int i = a.length-1; i>=0; i--) { for (int j = 0; j < i; j *= 2) { // one print statement here } }

B. Show the array content after each pass (a pass is defined as one completion of inner loop) of selection sort and bubble sort. Implement selection sort and bubble sort with Java code.