Write a recursive function that prints all the proper divisors of a positive integer n. A proper divisor of an integer n is a divisor other than n. Examples: if the function receives 10, it will print 1, 2, 5. If the function receives 7, it will print 1.