Problem 3. Consider the following pseudo-code fragment. 1 2 def stars (n): for i in [1:n] : print '*' i many times 3 a) Using the O-notation, upperbound the running time of STARS. b) Using the N-notation, lowerbound the running time of STARS to show that your upperbound is in fact asymptotically tight. Problem 4. Recall the problem we covered in lecture: Given an array A with n entries, find 0