Question $2(4$ points$)$

Which of the following are characteristics or applications of the Johnson$-$Trotter algorithm? Choose all that applies

Question $2$ options:

Each generated permutation is unique throughout the algorithm's execution.

It has been used in generating Gray codes.

It can be applied in solving permutation$-$based puzzles.

It is efficient for generating permutations of large sets due to its linear time complexity.