I need help on this C++ Program. Please follow the Modifications required and make the output match the example shown below.

DESCRIPTION Write a C++ program implemented in a single source file named permutations.cpp that uses two decrease- and-conquer algorithms for generating permutations. The two algorithms are Johnson Trotter and Lexicographic Permute. The pseudocode for these algorithms are provided in this assignment. Each permutation should be printed to the screen in the specific way as the example output at the bottom of this assignment. JOHNSON TROTTER 1: ALGORITHM JoOHNSONTROTTER(n) 2: /Johnson-Trotter Algorithm for generating permutations 3: /Input: A positive integer n 4: Output: List of all permutations of1,,n while P contains a mobile element do 6: 7: 8: 9: Find the largest mobile elementk swap k with its adjacent element that k's arrow points to reverse the arrow of all elements larger than k add P to the list of permutations 10: 11 end while 12: end ALGORITHM DESCRIPTION Write a C++ program implemented in a single source file named permutations.cpp that uses two decrease- and-conquer algorithms for generating permutations. The two algorithms are Johnson Trotter and Lexicographic Permute. The pseudocode for these algorithms are provided in this assignment. Each permutation should be printed to the screen in the specific way as the example output at the bottom of this assignment. JOHNSON TROTTER 1: ALGORITHM JoOHNSONTROTTER(n) 2: /Johnson-Trotter Algorithm for generating permutations 3: /Input: A positive integer n 4: Output: List of all permutations of1,,n while P contains a mobile element do 6: 7: 8: 9: Find the largest mobile elementk swap k with its adjacent element that k's arrow points to reverse the arrow of all elements larger than k add P to the list of permutations 10: 11 end while 12: end ALGORITHM