18) What is the worst-case runtime of searching for a value in a binary search tree? (a) constant O(1) (b) logarithmic O(logn) (c) linear O(n) Page 6/8 COMP 1006/1406 Summer 2018 Sample Final 19 Suppose the runtime of the bar (int [] numbers, int i) method is O(n), where n is the length of the input array. What is the runtime of the method foo when the input array has length n? 1 public void foo(int [] numbers) for(int 1-0; iMath . og (numbers .length); jt-1)( 3 bar (numbers, 2*i); (a) O(n) (b) O(n logrn) (c) O(n2)