In the book the following methods are presented:
static void selectionSort(Comparable list)static void insertionSort(Comparable list)static boolean linearSearch(Comparable list, Comparable target) // true if target in liststatic boolean binarySearch(Comparable list, Comparable target) // true if target in list
Your task is to implement a class SearchSort, including recursive variants of these methods. The signatures of the methods should correspond to the ones given above. The class should also contain a method static boolean isSorted(Comparable list) returning true if and only if the input list is sorted (smallest element rst).
Also write a program SearchSortMain showing and testing all methods.