Q. A sequence X1, X2, ... , Xn is said to be cyclically sorted if the smallest number in the sequence is Xi for some unknown , and the sequence Xi, Xi+1, Xn, ... , X1, X2,....Xi-1 is sorted in an increasing order. Design an algorithm to find the position of the minimal element in a cyclically sorted distinct elements. (6 points) If your algorithm uses recursion, you need so show the recurrence function. Otherwise, show a closed-end form of the running time function. (2 points) Show that your algorithm in (log ) time. (2 points) (No need to prove the bound).