EXERCISE 5: SIMPLE SORT ALGORITHMS AND ANALYSIS Given an array X (3, 6, 7, 8, 9, 10) that will be sorted into ascending order. 1. Use improved Bubble Sort, Selection Sort and Insertion Sort to sort array X. In the table below, show the results for each pass and give the total number of comparisons and exchanges. Improved Bubble Sort Total Comparison Total Swap After pass 1 After pass 2 After pass 3 Total Comparison Total Swap Insertion Sort After pass 1 After pass 2 After pass 3 After pass 4 After pass 5 Selection Sort Total Comparison Total Swap After pass 1 After pass 2 After pass 3 After pass 4 After pass 5 2. Compare the efficiency or the inefficiency of the algorithms based on the number of comparisons and the number of swaps. Which algorithm has the Worst performance and which algorithm has better performance to sort array X. 3. Explain how Selection Sort can be improved in sorting array X