Please do below 5 questions, and show the detials

Problem 1 Det and prove your answer: f(x) 0(h(z)) Determine whether the following statement is true or false -O(9(x)) and 1(z) If f(x) 0(h(x)), then Problem 2: Using standard big-O notation, describe the running time of the following algorithm (assume arrays are 0-indexed) function STRANGESUM(array X) count 0 while count