Question: Question 6 191 Suppose that an algorithm A executes 5n3+20n2 + 65n + 200 steps when nu with input of size n. Prove that the

Question 6 191 Suppose that an algorithm A executes 5n3+20n2 + 65n + 200 steps when nu with input of size n. Prove that the algorithm is in O(n*) (ie. A is in big-O of n*) a) 3] Using the predicate we defined in the class for the big-O notation, translate this statement into predicate logic (that is, using predicates and quantifiers) b) [6] Give a proof for this statement. Your proof can be a formal proof or informal (in natural language). but it must have a similar structure of a formal proof
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
