Let \(P\) be quicksort program to sort numbers in ascending order using the…

Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by $P$ for the inputs  [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?