Chapter 17, Problem 8PP

This project requires that you complete Programming Project 7 from this chapter and Programming Project 8 from Chapter 14. Programming Project 8 asked you to write a program to find all permutations of a set. Modify the program so that it generates permutations given an instance of the template-based set class defined in Programming Project 7. You may wish to also use your template-based set class to help simplify the implementation of the permutation algorithm itself. The algorithm requires that you store a set of lists. C++ allows you to create a set of lists with your template-based set class. For example, mySet<vector<T> > will define a set containing a vector of type T. Be careful to place a space between the last two >’s, or the compiler may get confused. The code mySet<vector<T>> without a space will likely produce a compiler error unless you are using C++11 or higher. Your program should print all permutations of sets of several different sizes and comprised of several different types of data (for example, a set of three integers, a set of four strings, or a set of five doubles).