5. For nding an item in a sorted array, consider "tertiary search," which is similar to binary search. It compares array elements at two locations and elminiates 2/3 of the rence equations are T(n) 2 + T(n/3), T(2) 2, and T(1) 1, where n is the size of the array. Explain why the equations characterize "tertiary search" and solve for T(n