In Big- notation, analyze the running time of the following pieces of code/pseudo-code. Describe the running time as a function of the input size

Stack s; //All operations on a stack take constant time.

for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { s.push(j); } for (int k = n; k > i; k--) { s.pop(); } } while (!s.empty()) { s.pop(); }