3. Define a sorting algorithm to be parsimonious i it never compares the same pair of input values twice. (Assume that all the values being sorted are distinct.) For example, it was shown in the notes that quicksort is parsimonious. (a) Is insertion sort parsimonious? Justify your answer with either a counterexample (b) Is merge sort parsimonious? Justify your answer with either a counterexample (c) Is heap sort parsimonious? Justify your answer with either a counterexample or or a brief argument or a brief argument a brief argument