úΣ@None7Given a sequence (e1,...en) to shuffle, and a sequence  (r1,...r[n-1]) of numbers such that r[i] is an independent sample + from a uniform random distribution [0..n-i], compute the 2 corresponding permutation of the input sequence. AGiven a sequence (e1,...en) to shuffle, its length, and a random ? generator, compute the corresponding permutation of the input  sequence. shuffle' wrapped in a random monad  random-shuffle-0.0.4System.Random.Shuffleshuffleshuffle'shuffleMTreeNodeLeaf buildTree