Consider P be a convex polygon with n vertices. Let q and r be a query points.
a) Assume n=3 and P has positive area. Explain how to determine efficiently whether exactly one of the point’s q and r falls inside of P. Analyze how much time is utilized.
b) Assume that n≥3 and the n vertices of P are stored in an array in clockwise order around P. Explain how to efficiently determine whether exactly one of the point’s q and r falls within the P. Analyze the time for your algorithm.