The function blackDog$($val$,$ List$)$ where List is a list of length n runs in O$($log$($n$))$ and returns a list of length n$.$

roundAndRound$($ListA$,$ ListB$)$

N $=$ length of ListA and ListB

ListD $=[]$

for a in ListA

ListC $=$ blackDog$($a$,$ ListA$)$

j $=$ N

while j $>0$

ListD $=$ blackDog$($j$,$ ListB$)$

j $=$ j $-1$

ListD $=$ ListD $+$ ListC

return ListD

What is the worst case asymptotic complexity for the pseudocode above?