Please provide a brief answer. I would really appreciate your help. I am trying to prepare for a test.

All tunctions mapR+ Rt. The talics above the question is just to think about the question in certain way. No need to respond to the italicized prompt they are just there for hints. Suppose that we have a function with a constantamount of work done in initialization, a call to a log-linear sorting algorithm, and a loop that iterates n times, doing a linear amount of work in each iteration. What is the running time of the algorithm? (Hint: When we w rite (1) + (n log n) + n (n)-( 2), we are saying given any functions ( ) E (1), J 2( ) E ( log n), and J 3 (n) e ( ), J I (( ) + J 2( ) + n J 3 ( ) E ( 2). You will want to go back to the definition of big Theta to assert what the expression Jlw)+/2(n)+f3 (a) really means.) Q) We often abuse notation and write expressions like f )-6(1) + log ) + n Using the definition of big e show that r -e 2