Consider the following recursive algorithm in pseudo-code: ALL-EQUAL(A,p,r) if (p == r) then return true else if (A[p] != A[r]) then return false else q = (p+r)/2 // this is integer division, example: 5/2 = 3 return ALL-EQUAL(A,p,q) AND ALL-EQUAL(A,q+1,r) - Describe with your words how ALL-EQUAL checks that all elements of the array A from index p to q are equal. Consider n = number of elements of A from p to r as the size of input for analyzing ALLEQUAL. - Provide the recurrence equation that represents its runtime T(n).