Question 1 (5 points): Purpose: To practice using the big-O notation. Degree of Difficulty: Easy 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 fi (n) = 1 000n2 + 3n! 2, fa (n) = n60 + 2n 3. fg (n) = 1000 + 3078n log(n) 4. f4(n) = 6 log(n) + 5n( -1) + 10n2 log(n) 5. fs(n)=-30n2+4n+n2318 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 On) showing that the function is in the category Ofn') Justifications for your answers are not necessary Just apply the rules and state the answers What to hand in Include your answers in a file called a7. txt. though PDF and RTF fles are acceptable. Clearly identify the question number and each part. If you are submitting a text file, you can write exponents such as n2 like this: n 2