Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting $n$ ($\ge 2$) numbers? In the recurrence equations given in the options below, $c$ is a constant.

In Quicksort, the worst case occurs when the partitioning routine always produces the most unbalanced split possible (for instance, when the pivot is always the minimum or maximum element).

In this scenario:

1. One subproblem has size $n - 1$.

2. The other subproblem has size $1$ (or $0$).

3. Partitioning the array takes linear time, $cn$.

Hence, the recurrence equation representing the worst-case time complexity is:

This solves to $O(n^2)$. Therefore,Option (B) is the correct choice.