computer graphic:

Consider a problem in the 2D plane. A. Explain in detail how one can determine whether a point Q is inside or outside of the area whose perimeter is defined by the N-sided polygon P = {P_0, P_1, ..., P_N-1}, with vertices P_K, and assuming that P is not self-intersecting. B. Does the technique described in Part A depend on whether the polygon P is convex versus concave (but not self-intersecting)? C. Does this technique work for self-intersecting polygons? Justify your