(2) For input sequence: ( {2,3,5,6,9,11,15} ), which algorithm needs the largest number of comparisons? A. Bubble Sort B. Insertion Sort ( sigma ) C. Merge Sort

(2) For input sequence: {2,3,5,6,9,11,15}, which algorithm needs the largest number of comparisons? A. Bubble Sort B. Insertion Sort b C. Merge Sort D. Ouick Sort