Ternary search is a search algorithm similar to binary search but it requires the array to be dividedinto 3 parts instead of 2 parts at each step. The time complexity of ternary search is(3)while thetime complexity of binary search is(2). It seems like there is an improvement in terms of timecomplexity since3 < 2.

Compare the time complexities of these two algorithms. Explain how the divisor affects the complexityof the search algorithm. Assuming the array haselements, what does the time complexity of thealgorithm become if we divide it intoparts at the beginning?