Practice problems using recursion

1. Write a procedure that uses recursion to print the list of prime factors of a given positive integer.
2. Write a procedure that uses recursion (and no loops) to print out all elements of a given list that are prime.
3. Write a procedure that uses recursion (and no loops) to decide if a given list is a palindrome.
4. Write a procedure that takes as input a list of (unsigned) single digit numbers and returns the integer formed by iterpreting the list as digits of an integer. You should use recursion and no loops.