Consider the problem of finding the smallest and largest elements in an array of n numbers. a$.$ Design a pre$-$sorting$-$based algorithm for solving this problem and determine its efficiency class. b$.$ Compare the efficiency of the three algorithms: $($i$)$ the brute$-$force algorithm, $($ii$)$ this pre$-$sortingbased algorithm, and $($iii$)$ the divide$-$and$-$conquer algorithm.#USE JAVA PROGRAM STRICTLY