In case of sorting an array in ascending order, Bubble Sort extends a sorted subarray at the

rightmost side and, Insertion Sort extends a sorted subarray at the leftmost side. Your friend, Jimmy

was told to find the first five largest and smallest numbers from a list of N distinct integers $($

N $>10).$ To solve the task, he modified the Bubble sort and Insertion sort algorithm for only $5$

iterations and used the rightmost and leftmost $5$ numbers as the $5$ largest and smallest numbers

respectively. Do you support his strategy? Explain with logical reasons.