Programming Language : JAVA

2. [10 minutes] Give an example recursive piece of code whose worst-case runtime T(n) is O(log n) where n is the size of the data input. What is the recurrence equation satisfied by T(n) for this code? .[10 minutes] Consider the code below, where myList is implemented as a array. Give the big-Oh worst-case time cost of this method, in terms of n which is the length of myList. (also, justify your answer) public int myMethod (List myList) int cntr0; for (int i. 0;"i