and

Write a summation for the worst case runtime of the following methods. You do NOT need to simplify or solve for an asymptotic bound. def bar(int n) { int sum = 0; for (int i = n; i > 0; i--) { for(int j = 0; j