Three major steps of a divide-and-conquer algorithm are: • Divide the problem in to two or more parts. • Solve each part separately. • Combine the partial solution. In the Quicksort algorithm, which...

Three major steps of a divide-and-conquer algorithm are:

• Divide the problem in to two or more parts.

• Solve each part separately.

• Combine the partial solution.

In the Quicksort algorithm, which of these steps represent most of the work. Please explain