Question 1 What is the time complexity of the following method (assume that the size of the array is N)? public int add100 (int[] array) { if (array.length =1; k=k/2) System.out.print (k); A. Of(logn)) B. Onlogn) C. Qn) D. None of the above Question 4 Given the following array as input: 5 78 4 51 12 4 90 0 2 26 the content of the array after applying Shellsort with Gap or h=5 is a) -4 78 0 2 12 5 90 4 51 26 b) 5 0 2 26 12 -4 90 78 451 c) -4 78 4 51 12 5 90 0 2 26