6. Given the binary search function and an integer array a below with the target t-65, list all layers of activation with their parameters in searching the target value. int search(int a[], int t, int 1, int r) { if(l>r) return -1: int m (I+r)/2: if(a[m]t) else if(a[m]

B1 Write a function powers array (b) that takes a list (or 1-dimensional numpy array) of length d representing a row vector [bo, ...,ba-1] (for some d) and returns a numpy array representing the matrix bo fd-1 ТТТ 60 d-1 : d-1

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false

5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r);   Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15).     -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