For an array of n elements, identify the minimum $($best case$)$ and maximum $($worst case$)$ number of passes through the array bubble sort will take to sort the array. The answers are of the form $[$best case$],[$worst case$].$

Group of answer choices

$1,$ n$-1$

n$-1,$ n$($n$-1)/2$

n$,$ n

n$-1,$ n$-1$