Dont worry about the runtime-analysis.txt.

7. Give a summation that represents the number of times the linex++ is executed in the following code segment, and derive its closed form. Then give the order of the algorithm using big-theta notation. Prove the big-theta result for the expression you derived public static int foo(int n) intx0, pMath.pow (3, n); for (int i -0;