Consider the function F below. The function takes as input an integer array A, and the size n of A. The array indices run from 1 to n. The division used is integer division, that it, it rounds down to the closest smaller (or equal) integer value. Give a expression for the functions time complexity. function

F(A[], n)

s 0

m n

while m > 0 do

for i 1 to m do

s s + A[i]

m m/2