A k-ary search is a searching algorithm to find a target value within a sorted sequence. In each step, a k-ary search divides the sequence into k parts. For example, a ternary search is a special case of k-ary where k equals 3.

a.) Given a sequence of length n, what is the worst-case time complexity of k-ary search? Assume k is constant and support your answer.

b.)Given a sequence of length n, what is the time complexity of n-ary search? Support your answer.