number 2 thank you please show steps

Assuming that all of these algorithms solve the same problem, which one would you recommend using. Briefly explain. e. 2. Complete the following divide-and-conquer algorithm to determine if all integers in an array a are equal. The initial call would be allElementsEqual a, 0, a.length-1). (Yes, there is an easy iterative algorithm for this problem. The goal here is to provide practice with the design and analysis of divide-and-conquer algorithms.) (30 points) bool al1ElementsEqual lint al,int p, int r) ( return true return false; / fill in from here Write a recurrence relation for your algorithm and then solve it to obtain the worst-case asymptotic time complexity for your algorithm. 3. Give a recurrence relation for the stated algorithm and then solve it (using the Master method) to get the asymptotic time complexity (20 points) void magicSort2(int A, int i, int j) Sorts the subarray Aij if {J--1) { // when there are only 2 elements if A[j]) swap IA, , j) // swaps A[i] and A[j] else int k- -i+1)73 magicsort2 (A,i,j-k): // sort first two thirds magicsort2(A,1tk,j // sort second two thirds 2:41 PM O Type here to search