LetSbe a set of two-dimensional points. Assume that allx-coordinates are distinct and ally-coordinates are distinct. A point〈x, y〉 ∈Sisacceptableif there exists a point〈p, q〉inSsuch thatx < pandy < q. Give a divide and conquer algorithm that gets a set of points asinput and outputs all acceptable points. State the recurrence of your solution, and write thesolution to the recurrece. You do not have to derive the recurrence.