rite a pseudocode for an algorithm for evaluating a polynomial of degree n, x)ant+ .tar +ao, at x-c. What is big-O estimate of the time complexity of your algorithm (in terms of the number of an-1 ltiplications and additions used) as a function of n? Explain your answer 14. Show that log(n!) is (m log(n)