1) What's the run time of each of the code snippets below using big O notation? Notel: Your big O must be tight, that is O(n") is not an answer since n" is an upper bound of any function Note2: Assume the size of the input array is n (n is variable). Note3: To receive credit, you should justify your answer. a) 1 void foo(int[) array) f 3 int 4 for (inti -e; i array.length; i) ( int sun . 0; 3 int product-1 um array[i]; for (int i-e; i