The Trotter-Johnson Algorithm for Generating All Permutations Using a Minimal Change Ordering The objective of this assignment is to write the function trotterjohnson.m that takes as input a positive integer N and uses a minimal-change ordering to construct a list L which will be a matrix, of all permutations of the values 1,2,3,... . N. Here?s how to do it: 1. Handle the special case of N equal to zero first. 2. Handle the special case of N equal to one next 3. Finally, handle all the other cases (a) Preallocate L to the correct size. (b) Initialize a pointer to the list L. The pointer serves as the place to insert a newly dequeued permutation of length N (c) Initialize a queue as a cell array and enqueue the vectors1,2 and [2, 1], in that order The Trotter-Johnson Algorithm for Generating All Permutations Using a Minimal Change Ordering The objective of this assignment is to write the function trotterjohnson.m that takes as input a positive integer N and uses a minimal-change ordering to construct a list L which will be a matrix, of all permutations of the values 1,2,3,... . N. Here?s how to do it: 1. Handle the special case of N equal to zero first. 2. Handle the special case of N equal to one next 3. Finally, handle all the other cases (a) Preallocate L to the correct size. (b) Initialize a pointer to the list L. The pointer serves as the place to insert a newly dequeued permutation of length N (c) Initialize a queue as a cell array and enqueue the vectors1,2 and [2, 1], in that order