Write a function that takes in two numbers and recursively multiplies them together.

Write a function that takes in a base and an exp and recursively computes base exp . You are not allowed to use the ** operator!

Write a function using recursion to print numbers from n to 0.

Write a function using recursion to print numbers from 0 to n (you just need to change one line in the program of problem 1).

Write a function using recursion that takes in a string and returns a reversed copy of the string. The only string operation you are allowed to use is string concatenation.

Write a function using recursion to check if a number n is prime (you have to check whether n is divisible by any number below n).

Write a recursive function that takes in one argument n and computes F n , the n th value of the Fibonacci sequence. Recall that the Fibonacci sequence is defined by the relation

F n = F n−1 + F n−2

where F 0 = 0 and F 1 = 1

Visit the Wikipedia page on the Fibonacci Number for more information if you’re still confused.