Page 1259 - AP Computer Science A, 7th edition
P. 1259
35. (E) Here is a “box diagram” for mergeSort(0,3). The boldface numbers 1–6 show the order in which the mergeSort calls are m ade.
The mergeSort calls in which first == last are base case calls, which means that there will be no further method calls.
