2 3. Consider the following algorithm implemented in python: (18 points) def chocolateAlgorithm (n) #Input is a positive integer n if n= 1: return 1 else: return chocolateAlgorithm (n-1)2 n -1 a-) Set up a recurrence relation for this function's values and solve it to determine what this algorithm computes. b-) Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c-) Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it