Design an algorithm for the following problem using the divide and conquer paradigm: Suppose you want to fly from Des Moines to San Diego. You would like to find a less expensive flight with a short travel time. When you search 011 a travel web site, you will be given a lot of itineraries. We will view each itinerary as a tuple cost, time. Suppose A_1 = c_1, t_1 and A_2 = c_2, t_2 are two itineraries. We say that A_1 dominates A_2, if c_1