1. (a) Consider the Johnson- Trotter algorithm for n = 4, with the current permutation of 3 2 4 1 produce the remaining permutations starting from the current permutation.

(b) In producing the Lexicographic permutations what will be the next number that follows 364125. Clearly trace the algorithm to show how the next permutation is produced. No points without supporting work.