Assume that we want to apply mergesort to sort the array A with $5$ elements where the initial

values of the array elements $($from $A[1]$ to $A[5])$ are A:$[3,4,0,2,1].$ How many times do we

push an activation record $($for quicksort or partition$)$ onto the runtime stack before the

completion of the algorithm? Note that Quicksort $(A,1,5)$ is the first activation record pushed

onto the runtime stack. The Quicksort algorithm here refers to the one taught in this class.

None of them

$10$

$12$

$11$

$13$