Suppose you had 5 algorithms, and you analyzed each one to determine the number of steps it required. and expressed the number of steps as a function of a size parameter, as follows: 1 (n) 2 2539n log[(n) For each of the given functions, express it using big-O. For example, if f(n) 17n4 +42 then we would write f(n) O(n): you could also write f(n) E O(n4) showing that the function is in the category O(n Justifications for your answers are not necessary. Just apply the rules and state the answers