Discrete math Explain processes

3a. (5 points) Suppose you have a list of N real numbers and you want to write a computer program to find the smallest number on the list. Can the identification of this number be accomplished with o(N) actions/operations? (You may interpret 'operation' in any reasonable sense, like addition or reading to memory or shifting position as part of a sort.) If Yes, explain why it is possible. If No, explain why it's not possible. 3b. (10 points) Find an example of a function f(x) such that f(x) 00 as x co and f(x) grows at a slower rate than log x. (And show that it does!) In other words, prove that your answer satisfies f(x) = o(log x) 3c. (10 points) If f(x) and g(x) are functions that satisfy f(x)