Consider the problem of evaluating a polynomial equation of the form n-1 at a given point x0 What would be the complexity of your algorithm in case you were to design it following the brute-force methodology? Prove your claim. Does your algorithm solve the given problem with the best time efficiency? If yes, prove it. If not then provide an algorithm with a better time complexity and prove that it is better. a. b