4. Consider a ternary search algorithm similar to binary search algorithm, except that instead of a comparing with a single array element in each iteration we now have 2 elements at positions and distance from the beginning of the list. Draw out the decision tree for a list of 10 elements and analyze the worst case time of the algorithm as a function n, the number of elements in the list. (30pts)