Fill in the blanks in each of the following statements:

A selection sort application would take approximately ________ times as long to run on a 128-element vector as on a 32-element vector.

The efficiency of merge sort is ________.

What key aspect of both the binary search and the merge sort accounts for the logarithmic portion of their respective Big Os?

In what sense is the insertion sort superior to the merge sort? In what sense is the merge sort superior to the insertion sort?

In the text, we say that after the merge sort splits the vector into two subvectors, it then sorts these two subvectors and merges them. Why might someone be puzzled by our statement that "it then sorts these two subvectors"?