Lab 3

Due 9:40AM February 21, 2007

1. Design and implement a recursive program to print all permutations of a given string. For instance, given the string "hat" your program should print the strings "tha", "aht", "tah", "ath", "hta", and "hat".