Java pseudo code

Algorithm fun1(A, n)

input: array A of size n

output: update some values in A

i = n-1

while( i>0 && A[i] < A[1/2] do

tmp = A[i]

A[i] = A[i/2]

i = i/2

a. if A = {1,2,3,4,5,6,7,8] after calling fun(A,8)

i. How many times does line 3 "tmp = A[i]" execute?

ii. New value of A=

a. if A = [4,5,6,7,8,9,10,1] after calling fun(A)

i. How many times does line 3 "tmp = A[i]" execute?

ii. New value of A=

c. Best case time complexity:

d. Worst case time complexity:

ii. New value of A=