Question 3 (1 mark) What is the big-O characterisation in terms of n (n = hi-lo), of the running time of the following code segment? Algorithm 3(A, lo, hi): Input: array A containing integers, e hi) return; int value - (A[lo] + A[hi]) / 2; if (value > 10) printf("%d %d", la, hi); return; } 93/A, lo + 1, hi); Note: (x*y) means x (a) 011) On'3) (b) Odlog n) 012"n) (c) O(n) (d) On logn) le) On^2)