20 pts. Ternary search is a search algorithm similar to binary search but it requires the array to be divided into 3 parts instead of 2 parts at each step. The time complexity of ternary search is O(log3n) while the time complexity of binary search is O(log2n). It seems like there is an improvement in terms of time complexity since log3n