(In Java)

Implement an recursive algorithm that finds the smallest element in an array of n numbers. (If you do not use recursion, you will not get any credits.)

Solve a recurrence relation for the number of key comparissons made by your algorithm.

Find the Big-O complexity. (Show clearly how you have found the complexity to get credits.)