1. [20 points]Complete the following divide-and-conquer algorithm to determine if all integers in an array a are equal. The initial call would be allEqual(a,0,a.length-1). (Yes, there is an easy iterative algorithm for this problem but I WANT RECURSIVE. The goal here is to show me you can complete this divide-and-conquer solution and analyze it). boolean allEqual(std::vector A, int p, int r) { if (p == r) {return true;} if (A[p] != A[r]) {return false;} ------ more code here ----- } // here is the end of the function !!!! Write a recurrence relation for your algorithm ( This is T(n)) and then solve it to obtain the worst-case asymptotic time complexity (Big O) for your algorithm