simply just state the running time in big O notation.

here is some extra info and examples:

Analyzing running time of code (20 points) In this part you will practice your skills of estimating running time of code snippets. For each piece of code below, state the running time of the snippet in terms of the loop limit variable, n You should assume that the variables n and sum are already declared and have a value. You should express your answer using Big-O or Big-O (Theta) notation, though your Big-O bound will only receive full credit if it is a tight bound. We allow you to use Big-O because it is often generally understood to be as tight as possible. In all cases, your expressed bounds should be simplified as much as possible, with no extra constant factors or additional terms (e.g. O(n) instead of O(2n+5)) For each piece of code, state the running time and then give a short explanation of why that running time is correct. We are not asking for a formal proof-you'll learn how to do that in CSE 101. For now your explanation should simply include an (approximate but reasonable) equation for how many instructions are executed, and then a relationship between your equation and your stated bound. Place your answers in in your Part2.txt file in a section labeled RUNTIME Here is an example: Ex. for inti- 5; i