#9 With a correctly written bsearch that is correctly used in a correctly written insertlnOrder, what is the maximal number of times we should have to compare the key to an array element in terms of N? (Assume one single solitary call to insertlnOrder) A O(1) B O(log2N) C 0(N) D O(N'log2N) E O(N squared) #10 Same assumptions as above except now we count moving an array element as the operation to be counted. What is the maximal number of times we ever would need to move an array element in terms of N? A O(1) B O(log2N) C 0(N) D O(N log2N) E O(N squared) #11 What is the output of the following program? import java.io.*; import java.util.*; 2 4 public class P11 public static void main(String[] args) 6 7 8 9 10 System.out.println( mystery( 1234 ) ); static int mystery( int n) if (na-e) return 0; if ( n%2 ) return n + mystery( n/10 ); return mystery( n/10); 12 13 14 15 write the number