mplement Selection Sort in Haskell. You will need to implement three functions

a$)$ A function to find the minimum element in a list find$\_$min :: $[$Int$]->$ Int

b$)$ A function to remove one element from a list remove$\_$element :: $[$Int$]->$ Int $->[$Int$]$

c$)$ A selection sort function select$\_$sort :: $[$Int$]->[$Int$]$

In general, we find the head of the sorted list by calling the find$\_$min function on the unsorted

list and concatenating it with the result of a recursive call to select$\_$sort. The recursive call is

passed the unsorted list minus the minimum element by using the remove$\_$element function