Write a divide-and-conquer recursive function (C++ or python) countPositive(float Arr[], int first, int last) that counts the number of positive value in an array of real values. First and last are the indices of the first and last elements inside Arr[]. 2.Using comparison ,> or <, of real (float) numbers as a basic operation, set up and solve a recurrence relationship to compute the complexity of your code.

Need it ASAP

Thank you