For the running time questions, we don't necessarily need the detailed running time of the code, correct? As long as we know the dominant term, the rest do not matter. For instance, if there are two nested loops, the upperbound would be O(n^2). Any extra detail does not matter. For number 5, the correct answer is A * N^2 + B * N + C. I got this answer due to the two nested loops yielding n^2. However, I don't really understand why the B*n term is there.

I see. So am I giving it the right approach? Or am I supposed to know what every single term correspond to in the code (when given an answer selection such as that).