The following divide-and-conquer algorithm is proposed for finding the simultaneousmaximum and minimum: If there is one item, it is the maximum andminimum, and if there are two items, then compare them, and in one comparisonyou can find the maximum and minimum....