What is the execution time growth using Big O notation for a function whose number of

primitive operations executed is the following function of the input size: f$($N$)=$ nlog$($n$)+$ n$2$