(b) Write a function called void randperm (int n, int perm []) which fills the n-dimensional array perm with a random permutation. Follow this algorithm: 1. Initialize perm [] to the canonical permutation: 0, 1, 2, 2. Loop for i = 0, 1, 2, ..., n-1 (a) Generate a random index: k between 0 and n-1 (b) Swap the values of perm[i] and perm [k] n-1