Thanks for the help :)

Big O (Definition) We say that g(n) is O(f(n)) - read as, "g of n is Big O of f of n" - when there exists some constants k and n_0 (pronounced as "n nought or as n-sub-zero") such that: g(n) is bound by k * f(n) for problem size n >= n_0. Given the growth function, g(n) = 2n^2 + 4n + 3, determine the Big O. Prove that your analysis is correct by finding a constant k, and a constant no that satisfy the definition of Big O. Given the growth function, g(n) = 4n^3 + n + 1, determine the Big O. Prove that your analysis is correct by finding a constant k, and a constant n_0 that satisfy the definition of Big O. Given the following code segment, determine the Big O. Assume n is the number of elements in the array, myArray. void myMethod(int myArray[], int n) {int num1 = 15; int num2 = 20; int result = num1 + num2; for (int i = 0; i