This is my homework from Data Structure & Algorithm course.

My starter code is given below. Thanks for your help!

print Permutations printPermutations is a function that should take one string as input and print out the unique permutations of that string using 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. Q#include "esce310homework@1part02.h" #include #include VOU AWNE using namespace std; Evoid printPermutations (string word , int count) cout #include VOU AWNE using namespace std; Evoid printPermutations (string word , int count) cout