In Java using the algorithms i

A)Implement method partition(Integer[] A, int p, int r)

B)Implement randomized_Partition(integer[] A, int p, int r)

C)Implement method quickSort(Integer[] A, int p, int r)

D)Randomized-QuickSort(Integer[] A, int p, int r)

Partitioning the array The key to the algorithm is the PARTITION procedure, which rearranges the subar- ray Alp.]in place PARTITION(A, p, r) 1 x=A[r] 3 for j=ptor-1 i=i+1 6 7 exchange A[i + 1] with An 8 return i 1