The function depicted below searches for a given value x in the sorted array arr - What is the worst-case time complexity of the function? (4 marks) int function(int arr[], int 1, int r, int x) { 1 2 if (r >= 1) { 3 int mid 1+ (r 1) / 2; - if (arr[mid] == x) 5 6 7 8 return mid; if (arr[mid] > x) - 1, x); return function(arr, 1, mid return function(arr, mid + 1, r, x); 9 } 10 return -1; 11 }