Which of the following scenarios could lead to the worst$-$case time complexity for quick sort that picks the last element of the array as the pivot? Select all that apply.

$1$ point

Already sorted input array

Array with decreasing order of elements

Array with all equal elements

Randomly shuffled input array