Which algorithm builds a sorted array one element at a time by inserting each elementinto its correct position within the sorted region?*1 pointYour answer

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

Consider an array arr of size 5, initially filled with elements [2, 4, 6, 8, 10]. You want to insert the element 5 at position 2 in the array. What would be the array after the insertion?

In insertion sort, if an element is smaller than the previous element, what action does the algorithm take?a.Ignores the elementb.Moves the element to the end of the arrayc.Swaps the element with the previous oned.Leaves the element as it is

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).

. Describe an algorithm that inserts an integer x in the appropriate position into the list a1,a2, . . . , an of integers that are in increasing order