Given a set of n symbols and a size k write only an ITERATIVE algorithm to print all possible permutations of the given symbols with respect to the size given. For example: Given symbols ={'A','B', 'C'} and size = 2; Solution is {AA,AB,AC,BA,BB,BC,CA,CB,CC} and count = 9.