Consider the voting problem, where the integers $1$ to k are used to identify k candidates. Assuming there are n votes and n $>>>$ n$,$ which of the following approach would be the fastest one to determine the winner?

Group of answer choices

Use radix$-$sort

Use counting$-$sort

Use quicksort.

Use heap$-$sort

Use Merge$-$Sort.