i need help

2. (30 points) Recurrence Derive a recurrence for the running time of each al gorithm below and then solve the recurrence with one of the three methods we have learned. The solution should be a tight upper and lower bound solution. You must show the work of how to solve the recurrence. You do NOT need to write the algorithm. of n (1) An algorithm solves a problem of size n by recursively processing elements, and dividing takes O(n) time