Answer:
Check the explanation
Step-by-step explanation:
Package wrapping technique can he used to compute convex null of a set Q which was given by Jarvis march
The running time of the algorithm runs in 0(M), where h is the number of vertices of CH (0). The total running time for K convex la, and the I. layer contains li points is.
Kindly check the attached image below to see the step by step explanation to the question above .