et S be a set of n points in the plane. Each point pi, i = 1, 2, ...., n, is specified by its coordinates ( xi, yi ). Let q be another point, also specified by its coordinates ( x0 , y0 ). We wish to find a striaght line y = mx + b through q with the following property: Of the points S, at most half satisfy y < mx + b , and at most half satisfy y > mx + b. Describe an efficient algorithm to find such a line. Also derive the time complexity of your algorithm. ( Hint : Make the point q as the new origin, draw a circle from the origin, next find the median and finally use Prune and Search ).