Please write code in C++ or C, details would be really helpful. If can, please give output screenshot.

1 Setting You already have recursive and stack-based code that prints all subsequences of an input string The I/O format has been fixed. The input and output files are given as command line arguments. The first line of the input file is read into a string. This is processed by a function to produce a list of strings as output. This list is sorted and then printed to a file. This is exactly the setting you will see in your test. For the stack section test, you will have to implement one of the follow- ing functions. Pay attention to the declaration. You cannot use recursion to implement these functions. You must use a stack based implementation. There are three functions that you need to study for the test. For your test, you will be given one of these to code up. In all cases, you can assume that input is purely alphanumeric and that the argument k > 0. List all Anagrams (string input). An anagram of a string is just a permutation of the string. You must write a function that produces all anagrams of the input string in a list. The order does not matter. For example, if the input string was "abc", the function should output a list containing the following strings: abc, acb, bac, bca, cab, cba. 1 Setting You already have recursive and stack-based code that prints all subsequences of an input string The I/O format has been fixed. The input and output files are given as command line arguments. The first line of the input file is read into a string. This is processed by a function to produce a list of strings as output. This list is sorted and then printed to a file. This is exactly the setting you will see in your test. For the stack section test, you will have to implement one of the follow- ing functions. Pay attention to the declaration. You cannot use recursion to implement these functions. You must use a stack based implementation. There are three functions that you need to study for the test. For your test, you will be given one of these to code up. In all cases, you can assume that input is purely alphanumeric and that the argument k > 0. List all Anagrams (string input). An anagram of a string is just a permutation of the string. You must write a function that produces all anagrams of the input string in a list. The order does not matter. For example, if the input string was "abc", the function should output a list containing the following strings: abc, acb, bac, bca, cab, cba