Consider the following variation of Bucket Sort (Example 3 in lecture): instead of dividing [0,1) into n equal-sized subintervals as buckets, we divide it into 42 equal-sized subintervals. Assuming the input keys are uniformly distributed, what does the worst-case runtime become? A. (n3) B. (n2) C. (nlogn) D. (n)x Consider the Decision Tree for sorting 7 (seven) numbers, which of the following statements are TRUE? Select ALL that apply. Note that 7 ! (factorial) is 5040. A. The decision tree has 5040 nodes in total B. The decision tree has at most 5040 leaf nodes C. The decision tree must be a binary tree. D. The decision tree has at least 5040 leaf nodes E. The height of the decision tree is 7 (counting the number of edges)