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(f(n). explain n^2 log n + 2n