Please resolve this issue with explanation.

Please answer the bonus question as well and defend your answer for it.

3. onion-peeling depth of a set of points on the 2D plane is defined to be the number of convex huls that can be formed by successively "peeling" the outermost convex hull of the original set is convex hull is computed for the interior points, then removed leaving the "more inter This is done until no points remain. The number of iterations of convex hul peeling depth of the original set of points Determine the onion-peeling depth of the following point set. (10 pts.) hull until no points remain. That is, the computed, then removed leaving the interior points behind. Another ior" points behind. the onion Onion-pe BONUS: What would be the optimal complexity of calulating this v exity value? Defe