C++ (eclipse):

Create a C++ program that computes all combinations of a string with and without repetitions. Note that I am not asking for the number of combinations but actual possible combinations of the alphabets of input string.

**** Combinations ARE NOT the same thing as permutations. For example, the combinations of AB without repetition would be: "ab" and with repetition would be: "aa", "ab", and "bb".