Polygon Containment

Bob has created $N$ convex polygons on a $2-D$ plane, which are numbered from $1$ to $N$. He wants Alice to pick a maximum subset of these polygons such that no two polygons, $i, j$ $(i \ne j)$, chosen in the subset are such that the $i^{th}$ polygon is contained strictly within the $j^{th}$ polygon or vice-versa. Help Alice find the size of the maximum subset. **Note:** - By maximum subset, we