printPermutations printPermutations is a function that should take one string and one integer n as input and print out the first n unique permutations of that string according to the Johnson-Trotter algorithm. Each permutation should appear on a separate line. Section 4.3 in The Design and Analysis of Algorithms may be of some use. You can assume that the string is already in lexicographic order. Use C++ to code. Some answers here on chegg do not output the correct list , so I have provided a test case

For example, Input "bmnov" and 72 should return a list in the exact order as this one:

permutations: bmnov bmnvo bmvno bvmno vbmno vbmon bvmon bmvon bmovn bmonv bomnv bomvn bovmn bvomn vbomn vobmn ovbmn obvmn obmvn obmnv obnmv obnvm obvnm ovbnm vobnm vbonm bvonm bovnm bonvm bonmv bnomv bnovm bnvom bvnom vbnom vbnmo bvnmo bnvmo bnmvo bnmov nbmov nbmvo nbvmo nvbmo vnbmo vnbom nvbom nbvom nbovm nbomv nobmv nobvm novbm nvobm vnobm vonbm ovnbm onvbm onbvm onbmv onmbv onmvb onvmb ovnmb vonmb vnomb nvomb novmb nomvb nombv nmobv