One way to determine whether a point p₀ is in the interior of a simple, but not necessarily convex, polygon P is to look at any ray from p₀ and check that the ray intersects the boundary of P an odd number of times but that p₀ itself is not on the boundary of P. Show how to compute in Θ(n) time whether a point p₀ is in the interior of an n-vertex polygon P.