Been stuck at this question for quite awhile. A detailed explanation will be much appreciated! Will give a like and thank you in advance!

(a) The number of operations in algorithm A and B are 8nlogn and 2n2, respectively. Determine n0 such that A is better than B for nn0. (5 marks) (b) For each of the following functions, indicate how much the function's value will change if its argument is increased m fold. Based on your results, explain why O(log2n) is considered more efficient than O(n) and O(n2). (10 marks)