Right option is (c) It first aligns two sequences using the Needleman-Wunsch algorithm and calculates the score
To explain: It first aligns two sequences using the Smith–Waterman algorithm and calculates the score. The shuffled sequence is realigned with the unshuffled sequence. The resulting alignment score is recorded. This process is iterated many (normally 1,000) times to help generate data for fitting the Gumble distribution.