Write a recursive function to print all possible permutations of a given string. For
example if the input string is “abc” then the set of permutations is: abc, acb, bac,
bca, cab, cba. Hint: Generate all permutations that start with 'a',then 'b' then 'c'. To
generate permutations starting with 'a', we need to find all permutations of "bc"