Given an array of n distinct numbers already sorted (in ascending order), we apply Hoare-Quicksort, Lomuto-Quicksort, and Heapsort separately to sort it into ascending order. Assume that we always have the array size n > 100. Select the correct answer for each question. 1 3 Which sorting algorithm will make the fewest number of swaps? Which sorting algorithm will make the fewest number of key comparisons 1. Hoare-Quicksort 2. Lomuto-Quicksort 3. Heapsort

Given an array of n distinct numbers already sorted (in ascending order), we apply Hoare-Quicksort, Lomuto-Quicksort, and Heapsort separately to sort it into ascending order. Assume that we always have the array size n > 100. Select the correct answer for each question. 1 3 Which sorting algorithm will make the fewest number of swaps? Which sorting algorithm will make the fewest number of key comparisons 1. Hoare-Quicksort 2. Lomuto-Quicksort 3. Heapsort