(a)If all the elements in an input array of size π are identical, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input.
Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort
(b) If the elements in an input array of size π are sorted in reverse order, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input.
Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort
(c)If the elements in an input array of size π are already sorted in the correct order, list the following sorting methods in order of efficiency (most efficient to least efficient) on that type of input. Explain your reasoning and include an analysis of the runtimes on that type of input. Methods: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort
