5. For finding 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 array. To analyze the number of comparisons, the recurrence 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) 6. To analyze the time complexity of the "brute-force" algorithm in the programming part of this assignment, we would like to count the number of all possible routes. (a) Explain the number of all possible routes in terms of n (number of locations). (b) Consider a computer that can process 1 billion routes per second and n is 100 , explain the number of years needed to process all possible routes. (c) If we don't want the computer to spend more than 1 minute, explain the largest n the computer can process