Problem
1. What is the maximum value achievable by count when inside is executed on a polygon with N vertices? Give an example supporting your answer.
2. Write an efficient program for determining whether a given point is inside a given quadrilateral.