Please answer the following questions:

1) Work out the exact time complexity T (n) of the following piece of code in terms of the number of operations:

2) You have found empirically that the implemented sorting methods A of complexity (n^3) and B of complexity (n^2 log10 n) spent 2 and 10 time units, respectively, to sort an array of 100 objects. Find out how many time units will each algorithm spend for sorting an array of 1, 000, 000 objects? (10 after log is a subscript)

for (int k = n; k 1: k/= 3 ) { for (int i=0; i n; | += 2 ) { // constant number C of operations for (int j = 2; j n: j = ( j * j ) ) { // constant number C of operations