My gut tells me that for loop is best but I also feel like you could use a map function if you were to implement a randomization function and include it as part of the map action

The Fisher-Yates shuffle is a method for randomly permuting (shuffling) an input vector. A particular variant of the method works by randomly swapping the values of items in the vector. For a length n vector, the algorithm runs in n steps. At the kth step, a random number from 1 to (n - k) is generated and the (n - k) th entry is swapped with the value at the random number's position. Which of the following would be the best tool to construct this algorithm (pick the best answer)? O map O map dbl O A for loop O mutate