Choose the correct answer: With size n, if Algorithm A requires [log n] comparison while Algorithm B requires [log n], then Algorithm A is Question 12 0 out of 1 points Choose the correct answer: In Algorithm BINARYSEARCH, what is the number of remaining elements in the (j- 1)th pass through the while loop? Question 11 1 out of 1 points Choose the correct answer: With size n, if Algorithm A requires [logn] comparison while Algorithm B requires [logn], then Algorithm A is Question 14 0 out of 1 points Choose the correct answer: In Algorithm LINEARSEARCH, the number of comparisons decreases when the number of elements