I'm doing some practice questions on Big O notation and came across this question. What is the Big O order of function ๐(๐) = ๐^2 + ๐ log2(๐) + log2(๐). Show your working.
My answer is O(n^2) because it's the term with the highest degree. However, I'm not really sure how to show it. Am I right by saying that it has to be proven like this -> f(n) is an element of O(n^2). So far, I've only done questions like n^2 + 2n + 1 and I have to find c and k values. I'm not quite sure how to do this one. Can anyone help me out, please?
Thanks