In Big-O notation, analyze the running time of the following three pieces of code/pseudo-code. Describe it as a function of the input size (here, n) Notice that this code is very similar to what will happen if you keep inserting into an ArrayList. Notice that this is NOT an example of amortized analysis because you are only analyzing 1 call to the function f() Amortized analysis examins multiple calls to a function. But you may use similar ideas/approaches as amortized analysis to analyze this runtime int f (int n) int anew int [10] int size 10; for (int = 0; i