use java

Implement an recursive algorithm that finds the sum of all integers given in an array. 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.)