Assume that that an array has 10 elements, if a comparison based sorting algorithm is used, what is an approximate height for the decision tree that will be generated by the comparison based sorting algorithm? Select one: O a 1000 b. 10! oc. 10 log 10 d. log 10 e. 100 Assuming that counting sort is used, how many comparisons will be done between the elements of an array with 10 elements? Select one: O a. 0 b. 100 O c. 10 d. log 10 e. 10 log 10