6 4 7 1 8 6 4 1 7 8 6 4

Explanation:

1) The most straightforward sorting method is Bubble Sort, which repeatedly switches nearby components if they are in the wrong order. Large data sets should not be used with this approach due to their high average and worst-case time complexity. Hence a) Bubble sort is the wrong answer

2)The selection sort method sorts an array by repeatedly selecting the first element from the unsorted portion that is the least in value while still taking into account ascending order. Hence  b) Selection sort is the right answer

3)Insertion sort, a simple sorting algorithm, works similarly to how you would arrange playing cards in your hands. The array is split roughly into sorted and unsorted components. From the unsorted portion of the data, values are selected and assigned to the proper spots in the sorted portion. Hence d) Incorrect insertion sort

4)Sorting is the methodical arrangement of objects. The popular sorting algorithm known as Quicksort sorts an array of n elements with an average of n log n comparisons. It is a sorting algorithm that is both quick and very effective. This program employs the strategy of "divide and conquer." The divide and conquer method entails breaking down the algorithms into smaller problems, resolving those smaller problems, and then merging the solutions to solve the larger problem. Hence Option d) is wrong