Let P be a given polygon (not necessarily convex) whose vertices are {v1,...vn} appearing in this order along boundary. Suggest an O(n) time algorithm that creates a new data structure, so you could answer the following query in O(logn): Given a query line L ={(x,y)|ax+by=c}, does L intersect P? Note that if b= 0 and start by finding in O(logn) the highest and lowest points of P.