An image is searched for objects that are no bigger than NXM pixels. We create a prior decided augmented path $.$ We increased $$ until maximum object detention is achieved which is cXt assume $m$ edges. What is the complexity?

A$)$ Mxlogc

B$)$ Mc

C$)Ctm$

D$)$ Log ctm

E$)C2tm$