1. [20 points) CLRS 5.3-3: Suppose that instead of swapping element Ali] with a random element from the subarray A[i..n, we swapped it with a random element from anywhere in the array. Algorithm 1 Permute with All PERMUTEWITHALL (A) n ? Alength for i1 to n do swap Ali] with A[RANDOM(1,n)] Does this code produce a uniform random permutation? Why or why not