** Deterministic bogo sort, we need to be sure we are not randomly going through permutations, we need to make sure we go through every possible permutation.

3, Deterministic BogoSort is a sorting algorithm which achieves the very exciting (n!) runtime. Moreover, this algorithm is very simple to express in pseudocode Algorithm 1: det-bogoSort(L) Data: An unsorted list of n integers L Result: A sorted copy of L for every possible permutation E Sn expressing a reordering of elements in L do L' A copy of L reordered according to if L' is sorted then return L' endL end For example, to sort 3,2,1], this algorithm would check the permuted lists L' { [3, i , 2] [2, 3 1] [2 1 , 3j, [1 , 3, 11 , 2, 3)) in some arbitrary (implementation specific) ordering, and only return after stumbling upon the assignment L' [1, 2, 31, Im- plement det-bogoSort in pseudocode using recursion. (**) 3, Deterministic BogoSort is a sorting algorithm which achieves the very exciting (n!) runtime. Moreover, this algorithm is very simple to express in pseudocode Algorithm 1: det-bogoSort(L) Data: An unsorted list of n integers L Result: A sorted copy of L for every possible permutation E Sn expressing a reordering of elements in L do L' A copy of L reordered according to if L' is sorted then return L' endL end For example, to sort 3,2,1], this algorithm would check the permuted lists L' { [3, i , 2] [2, 3 1] [2 1 , 3j, [1 , 3, 11 , 2, 3)) in some arbitrary (implementation specific) ordering, and only return after stumbling upon the assignment L' [1, 2, 31, Im- plement det-bogoSort in pseudocode using recursion. (**)