learn the implementation of insertion sort.

In the lecture, we saw the implementation of insertion sort for sorting integers in ascending order. Your task is to modify the implementation of insertion sort algorithm to accept generic data types $($e$.$g$.,$ float$)$ and to sort the array in descending order. That is$,$ convert the algorithm to use generic data types. Specifically,

$1.$ Create a class called SortingAlgorithm

$2.$ Implement a generic method bubbleSort that sorts a generic data type array.

$3.$ Create an array of $10$ floats, e$.$g$.[10\mathrm{.}0,3\mathrm{.}5,3\mathrm{.}1,5\mathrm{.}5,10\mathrm{.}2,30\mathrm{.}3,50\mathrm{.}1,78,90\mathrm{.}4,12\mathrm{.}4]$

$4.$ Sort the array using insertion sort to sort the array in descending order.

use Comparator class to implement comparing generic data types.