Consider the following pseudo-code for randomly permuting an array A of size n:

Consider the following pseudo-code for randomly permutan code for randomly permuting an array A of size n: For i = 0 ton-1: Swap(Ali), A(Random(0,1 - 1)]) (1) returns a random integer uniformly distributed in the range i through j (inclusive). (hint: use decision trees) "y choice of n > 2, not all permutations are equally probable using this pseudo-code Give pseudo-code for a method to randomly permute a list without this flaw. Prove that all possible permutations are equally likely using your technique. Consider the following pseudo-code for randomly permutan code for randomly permuting an array A of size n: For i = 0 ton-1: Swap(Ali), A(Random(0,1 - 1)]) (1) returns a random integer uniformly distributed in the range i through j (inclusive). (hint: use decision trees) "y choice of n > 2, not all permutations are equally probable using this pseudo-code Give pseudo-code for a method to randomly permute a list without this flaw. Prove that all possible permutations are equally likely using your technique