We are given a convex polygon in $2$D stored in memory as a list of $2$D points in clockwise order. For any $2$D point p$,$ we can test whether p is in the interior of the polygon or not in O$($n$)$ time.

Group of answer choices

True

False