7. Consider the following algorithm, answer question a-c: (10 points) Algorithm Some Algorithm(n) // Input: n, a nonnegative integer // Output: a real number If n 0 : return 1 Else: return 1 + 3 * Some Algorithm(n-1) == a) Let F(n) denote the return value of Some Algorithm(n). Set up a recurrence relation for F(n), and solve the recurrence. b) Let NumMul(n) denote the number of times multiplication operation is executed when running Some Algorithm(n). Set up a recurrence relation for NumMul(n), and solve the recurrence