Write Java code for Quicksort and Main. 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. Do not import collection libraries $($ex$.$ HashMap, HashSet, Iterator $.....)$ Be sure to chek out the example I provided in the picture but use another array characters.