What is the order of complexity of the following function? int Mystery(int start, int end, int a, int array[]) { int index 1, index2; index 1 (end-start)/3+start; index2 (2*(end-start))/3+start; a)) } if(start == end) return start; else{ } if(array[index 1] = a) && (array[index2] < return Mystery(index 1, index2, a, array); return Mystery( index2, end, a, array); else Note: array[] is given in descending order.