Implement Ternary Search

Ternary search is a searching algorithm similar to binary search but divides the search space into three parts instead of two $($as illustrated in the figure below$).$

Write a python function $($you can choose between iterative and recursive solution$)$ that implements the ternary search algorithm. The input to the function is an array of integers sorted in ascending order, and a 'target'. You can add additional parameters to the function if needed. Here are some hints for your implementation:

If the 'target' is equal to one of the midpoints, the search is successful, and the function should return the corresponding index $($mid$1$ or mid$2).$

Otherwise, the function should narrow down the search space to 'left segment' or 'center segment' or 'right segment' based on the value of 'target'.

If the 'target' is not found within the array, the function should return $-1.$