In Selection Sort, what is the minimum number of comparisons required to find the smallest element and place it in the first position of the array?

Using our Selection Sort algorithm, after one pass of the Selection Sort, the smallest element is in its correct place in the array.Group of answer choicesTrueFalse

Which sorting algorithm is based on the principle of repeatedly selecting the minimum element from the unsorted part of the array and placing it in its correct position?Group of answer choicesSelection SortMerge SortBubble SortInsertion Sort

If a list of elements is already sorted in ascending order, how many comparisons are needed in the worst-case scenario to find an element using Binary Search?

Which sorting algorithm repeatedly selects the minimum (or maximum) element and places it at the beginning (or end)?Options: Pick one correct answer from belowBubble SortSelection SortInsertion SortQuick Sort

Write a program to implement the Selection Sort algorithm to sort an array of integers in ascending order.Input:91 3 5 7 9 2 4 6 8Output:1 2 3 4 5 6 7 8 9Explanation:Initially, the minimum element in the array is 1. It is swapped with the first element, resulting in the array [1, 3, 8, 2, 5, 4]. Next, the minimum element in the remaining unsorted part is 2. It is swapped with the second element, resulting in [1, 2, 8, 3, 5, 4]. This process continues, and the final sorted array is [1, 2, 3, 4, 5, 8].