Suppose you have a variation of insertion sort that used binary search to find the correct slot for the ith number among the i-1 numbers that have been processed so far. What is the worst-case complexity of this new insertion sort be?

(A) O(n)
(B) O(n logn)
(C) O(n)
(D) O(n2 log)

Why is it uncommon for users to perform searches directly in database tables? a.)users are discouraged from interacting directly with tables because they might confuse tables with spreadsheets. b.) users are discouraged from interacting directly with tables because this may result in unintended changes to source data. c.)users do not have the technical skills required to perform searches directly in database tables. d.)users do not have the permissions required to perform searches directly in database tables.