The ternary search algorithm is a modification of the binary search algorithm that splits the input not into two sets of almost-equal sizes, but into three sets of sizes approximately one third. (a) Verbally describe and write pseudo-code for the ternary search algorithm. (b) Give the recurrence for the ternary search algorithm. (c) Solve the recurrence to determine the asymptotic running time of the algorithm. How does the running time of the ternary search algorithm compare to that of the binary search algorithm. Show your work