This question is concerned with your understanding of various algorithms studied in this class.You are given an implementation of a sorting algorithm written by someone else. You know that the algorithm being implemented is either Insertion sort, Quicksort, or Heapsort. You need to identify the implemented sorting algorithm by running it on carefully designed test cases.$($a$)$ You use the program to sort an array A that is in sorted order. Every time you double the number of elements to be sorted, the observed running time is approximately quadrupled.Which sorting algorithm is implemented?$($Select$($b$)$ You use the program to sort an array A that is in sorted order. Every time you double the number of elements to be sorted, the observed running time is slightly more than doubled but significantly less than tripled. You then use the program to sort an array A that is in reverse sorted order. Every time you double the number of elements to be sorted, the observed running time is slightly more than doubled, but significantly less than tripled. Which sorting algorithm is implemented?$[$ Select $]($c$)$ You use the program to sort an array A that is in sorted order. Every time you double the number of elements to be sorted, the observed running time is approximately doubled. You then use the program to sort an array A that is in reverse sorted order. Every time you double the number of elements to be sorted, the observed running time is approximately quadrupled. Which sorting algorithm is implemented?