Compute the running time of NaiveExp assuming that it takes O$($nlogn$)$ to multiply an n$-$bit by an

m$-$bit number provided n $>=$ m$.($Hint: You may use the fact that $$

L

k$=1$

k logk $=$ O$($L

$2$

logL$).)$