Divide and Conquer Algorithm

4. Given a set P of n points in the plane all with positive x and y coordinates, a given point p in P is rectangularly visible from the origin if there exists an axis aligned rectangle with one corner at the origin and one corner at p that contains no point q (other than p) of P Give a divide-and-conquer algorithm to determine the points of P that are rect- angularly visible from the origin Give a recurrence for the time required by your algorithm and give the order notation for the time required by your algorithm. 4. Given a set P of n points in the plane all with positive x and y coordinates, a given point p in P is rectangularly visible from the origin if there exists an axis aligned rectangle with one corner at the origin and one corner at p that contains no point q (other than p) of P Give a divide-and-conquer algorithm to determine the points of P that are rect- angularly visible from the origin Give a recurrence for the time required by your algorithm and give the order notation for the time required by your algorithm