Please answer the following question as soon as posibble. Will highly appreciate . Thank you

Algorithm 1 Algorithm S(n) 1: //Input: A positive integer n 2: //Output: The sum of the first n cubes 3: if n=1 then 4: return 1 5: else 6: return [S(n-1)+n*] a) Set up and solve a recurrence relation for the number of times the algorithm's basic operation is executed How does this algorithm compare with the straightforward non-recursive algorithm for computing this function b)