1. Implement the function prototype for binary search below, where a[] is the array to be searched through, t is the target value, l and r are the left bound and the right bound of the array. Given the following array with t=19, list all activations. What is the complexity of the binary search function? (15 Points)

-9

-5

-2

0

1

3

7

11

17

19

21

25

27

31

37

41

a

index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

int search(int a[], int t, int l, int r){}