Problem
Consider a modified version of the binary search algorithm. It is called a ternary search. It spits the input not into two sets of almost-equal sizes, but into three sets of sizes approximately one third.
1. Verbally describe/ write pseudocode for ternary search
2. Write recurrence relation for your solution
3. What is the time complexity of your solution
4. Does your pseudocode use any of the algorithm techniques that we discussed in this course? If yes, name it.