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. | 5. What is the order, 0(?) of the following function? n3+100n2 +n 6. What is the order, O(?) of the following function? 2n + 100n2+ 45n 7. 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. n log n + log nun 8. 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. na log n + 2n