You have an integer array of length 5. What is the number of swaps needed to sort it using the Bubble Sort in the best case?
a) 0
b) 1
c) 2
d) 3