The following recursive algorithm returns the index of the smallest element in a list A containing n elements. The elements in the list are assumed to start from index # 1: findMin (startIndex, A) if startIndex = n // case of list containing one element return startIndex x = findmin (startIntex+1, A) // find min in elements index+1 .. n if A[x] < A[startIndex] // compare it with element at index return x // return the index of the smallest else return startIndex

Write a Recurrence Relation for the time complexity of this algorithm. then solve the recurrence relation using the characteristic equation method.