You are to write a program that creates permutations of an unknown number of strings of various sizes while removing duplicated permutations. For example, given the string "seed", all permutations are shown below with the duplicates crossed out: You program should only print out one instance of the duplicate. Print out all the permutations on one line (let it Wrap on its own) and leave one space between each permutation. Put one blank line between permutations sets. For example, your output for strings "seed" and "cats" should appear similar to below. The order of permutations is not important, but the words should be output in the same order as the data File. The data file is located at -dmk0080/public/1040/labs/exam l/permutewords and contain one word per line. Name your program premutations.c. You may use C or C + + style Strings, I/O. and even Dynamic Memory Management if necessary