Problem
1. Write a recursive function that will dispense change for a given amount of money. The function will display all combinations of quarters, dimes, nickels, and pennies that equal the desired amount.
2. Write a recursive function for placing eight queens on a chessboard. The eight queens should be placed so that no queen can capture another. Recall that a queen can move in the horizontal, vertical, or diagonal direction.