The list of numbers is to be sorted in decending order.Use the selection sort to obtain the sorted list.Show the list after every complete pass. 20 , 27 , 15 , 40 , 23 , 18 , 56 , 90 80 , 3 a) What is the best case time complexity of selection sort?

b) What is the advantage of selection sort over other sorting techniques?

c) Why selection sort is called selection sort?

d) Is selection sort a stable algorithm?

The list of numbers is to be sorted in decending order.Use the selection sort to obtain the sorted list.Show the list after every complete pass. 20,27,15,40,23,18,56,9080,3 a) What is the best case time complexity of selection sort? b) What is the advantage of selection sort over other sorting techniques? c) Why selection sort is called "selection" sort? d) Is selection sort a stable algorithm