What is the order, O(?) of the following function? 2" + 100n? + 45n Suppose an algorithm takes exactly the given number of statements for each value below, in terms of the size of n, i.e. the order of...

NB: DO NOT JUST WRITE THE ANSWER. You must explain in some way by (a) a diagram, (b) showing the order of each line of code in braces and finding the dominant term, (c) a graphical representation or (d) a few sentences. Failure to do so, will result in a reduced score.

Extracted text: What is the order, O(?) of the following function? 2" + 100n? + 45n Suppose an algorithm takes exactly the given number of statements for each value below, in terms of the size of n, i.e. the order of n, O(?). Explain. nlogn + log п +п Suppose an algorithm takes exactly the given number of statements for each value below, in terms of the size of n, i.e. the order of n, O(?). Explain. n2 log n + 2n