writing a function that determines the minimum and the maximum element in an input list of comparable elements. This function should be as efficient as possible in terms of its worst-case computational complexity. Does it make sense to use the pre-sorting technique to solve this problem? Justify your answer.