Suppose that instead of swapping element A[i] 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 ? A.length for i ? 1 to n do swap A[i] with A[Random(1, n)] Does this code produce a uniform random permutation? Why or why not?

Suppose that instead of swapping element Ali] with a random element from the subarray Ali.n], we swapped it with a random element from anywhere in the array. Algorithm 1 Permute with All PERMUTEWITHALL(A) nA.length for1 to n do svap Ai with A RANDOM(1,n) Does this code produce a uniform random permutation? Why or why not