Write Java code. Create $2$ classes. One for Quicksort algorithm and one Main class.

Sort an array of lowercase characters using Quicksort. The selection of the pivot element involves

computing the decimal representation in the ASCII table for each character in the array, summing these

representations, dividing the sum by the number of elements in the array $($rounding down to the nearest

integer if there are decimal points$),$ and then performing a modulo operation with the number of

elements. The remainder obtained from this operation is utilized as the index for the pivot element in

the sorting process.

Example, using above table:

$\{f,m,n,t,r,k,q,w\}-8$

$102+109+110+116+114+107+113+119=\frac{890}{8}=111\mathrm{.}25,$ floor$(111\mathrm{.}25)=111\%8=7.$

Pick index $7$ as a pivot$(\text{'}w\text{'}).$

Use another array characters for you assignment.