Page 7 of 1 Question 9 (6 marks) 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. In the box, give a 0 expression for the function's time complexity function F(A, n) s0 men while m 0 do for i to m do ssAi mm/2

"Get 15% discount on your first 3 orders with us"
Use the following coupon

Order Now