Thanks for the help :))

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 myMetnod (int myArray[], int n) {int num1 = 15; int num2 =20; int result = num1 + num2; for(int i = 0; i