$($Data structures and Algorithms$)$

If you have a crowded objected image find an item draw some arcs on the image of arbitrary path and length assume this it is NP is reduced with several techniques what is the complexity?

a$)$ Logn

b$)$ Nlogn

c$)N^2$

d$)N^3$

e$)N^{2}logn$