Given the following teranary search algorithm:

a.) What is the worst-case time complexity for this algorithm for an array of size n? Show the steps for analyzing the running time.

b.) Given binary and ternary search algorithms, which one runs faster in terms of number of operations? Support your answer.

def (thevalues (th Values target) left 0 right len thevalues) -1 while left K right index 1 (left*2 right) 3 index 2 (left right 2) 3 if thevalues lindex1] target return True