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 (here, n). You should always explain your work when solving mathematics problems. Part D Notice that this code is similar to what happens if you keep inserting into a vector. int *a = new int [10]; // new is 0(1) int size = 10; for (int i = 0; i<>