7. Implement the function prototype for binary search below, where a[] is the array to besearched through, t is the target value, l and r are the left bound and

the right bound of thearray. Given the following array with t=19, list all activations. What is the complexity ofthe binary search function? (15 Points) int search(int a[], int t, int l, int r){}