I want a program or algorithm in Java that generates all the possible permutations of length n. For example, the permutations of length 3 are: {1,2,3}, {2,1,3},{2,3,1}, {1,3,2}, {3,1,2}, {3,2,1}: f a non-recursive algorithm that computes all the permutations of size n. The only data structure allowed is a queue. a main function with sample output would be helpful