Let P be a convex polygon with n vertices{v1...vn},appearing CCW along P . Assume v1 is the left most vertex, and v[n/2] is the right most vertex. Show that given another point q ,you could find in O(logn) time whether q is inside P