answer problem2, is algorithm problem

Problem 1: Prove that if f(x) = o(g(x)), then we must have that f(x) = O(g(x)). For this problem, you must write a precise, formal proof. Problem 2: Using standard big-O notation, describe the running time of the following algorithm (assume arrays are 0-indexed) 1: function StraNGESuM(array X) 2: 3: 4: while count length(X 5: 6: 7: 8: 9: count