Please show your work

D | Question 1 10 pts Select the best answer. Consider any comparison-based sorting algorithm A. Algorithm A will perform at least comparisons to sort a sequence with 8 elements for the worst case. O None of these answers O 32 O 64 O 128 O 24 D | Question 2 10 pts Select the best answer. Consider the decision-tree to sort a 3 element sequence (a1, a2, ) in increasing order. If (a1, a2, a3)- (4.9, 5), the sorting will complete after comparison(s) 1:2 2 2:3 1:3 2:3 1.2.3):3(2.1.3) ONone of these answers 0 1 Question 3 10 pts Select the best answer. Consider the decision-tree to sort a 3 element sequence (ai, a2, a3) in increasing order. If (a1, a2, a3)- (4, 5, 9), the sorting will complete aftercomparison(s) 1:2 1,2.3 1:3 2:3 2 1,3,2) 1.2) (2,3,1 03 o 2 O None of these answers o 1 Question 4 10 pts Select the best answer. Consider the decision-tree to sort a 4 element sequence (a, a2, a3, a4) in increasing order. The height of the decision tree will be at least 0 6 O None of these answers 0 7 D Question 7 10 pts Select the best answer Consider the decision-tree to sort a 6 element sequence (a, a2, ag, a4, as, as) in increasing order. The number of possible permutations is O 120 O 24 o 12 O None of these answers Previous