Please write code in 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. List stretch(string input, int k). A stretch of the input string is generated by repeating each character in order up to k times and at least once). For input string "abc" and k = 2, the output list should have: abc, aabe, abbe, abce, aabbc, aabec, abbcc, aabbcc. (Again, the order does not matter.)