Q3. [10] Prove that n2 loga n= U(na) by the definition of big-Omega. Q4. [10] Prove that 2n2 - 51 - 3 = O(n2) either by the definition of big-Theta or by an alternative way with applying the limit function. Q5. [25] Maxsub algorithm in the textbook is to find the subarray whose sum is the maximum. Similarly, you can modify it to Minsub algorithm to find the subarray whose sum is the minimum and negative (