a) Show that each element A[index] has a probability of ending up in any particular position in B. b) Explain why the resulting permutation is not uniformly random. Activate Go to Sett (A) let B[1...n] be a new array RANDOM (1, n) offset for index = 1 to n PERMUTE-IN-CYCLES n = A.length = pos= index + offset if pos > n pos pos - n B [pos] =A[index] return B