For each of the following claims, decide if it is true or false. No explanation is needed. The following is a pseudocode of Insertion-sort. For instance A[1. . .8] =7,4,2,9,4,3,1,6,what is A[1. . .8] just before the for-loop starts for j= 5?

1. (20 points). For each of the following claims, decide if it is true or false. No explanation is needed. (a) (2 points) n log n =0(n). (b) (2 points) log logn=0(logn). c) (2 points) logn=0(70.1). (d) (2 points) 4" =0(2"). (e) (2 points) 100100 = E(1). (f) (2 points) if f =0(9), then g=2(f). (g) (2 points) if n3 = 12(122). (h) (2 points) If an algorithm's worst case running time is O(n?), it means that the running time is (n?) for all inputs of size n. (i) (2 points) 100 + 200n + 300m = O(n) () (2 points) - log i = (n log n). 2. (4 points) The following is a pseudocode of Insertion-sort. For instance A[1... 8] =(7,4, 2,9,4,3,1,6), what is A[1... 8] just before the for-loop starts for j=5? COos on WN Insertion-Sort(A) 1. for j = 2 to A.length 2. key = A[j] 3. // Insert A[j] into the sorted sequence A[1... j - 1]. i = j - 1 5. while i > 0 and A[i] > key 6. Ai + 1] A[i] 7. i = i - 1 8. Ai + 1] key