Given that the method man$\_$in$\_$the$\_$box$(*)$ always runs in O$($N log$($N$))$ time, what is the worst case complexity for the code below?

alice$\_$in$\_$chains$($inList$)$

N $=$ length of inList

for elt in inList

if elt is even

man$\_$in$\_$the$\_$box$($elt$)$

else

for val in inList

elt $=$ elt $+$ val

append elt to outList

return outList