Set up and solve (i.e., write in a closed form) a recurrence relation (using backward substitutions) for the following algorithm. Algorithm Sin) //Input: A positive integer n //Output: The sum of the first n cubes if n = 1 return 1 else return Sin - 1) Write pseudocode for the iterative (non-recursive) algorithm that achieves the same goal. Analyze the time and space complexity for both algorithms