the textbook is Intro to Algorithms 3rd edition, by Thomas Cormen. Please include the code and also a summary which specifies testing results. note the code should have both 2 versions.

Please Its very necessary to give a short description for each of your Java programs and Write instructions on how to compile and run your Java program.

Pls help asap, thank you

= C = Program Requirements Implement in Java two versions of the RANDOMIZED-QUICKSORT algorithm, one using the PARTITION procedure discussed in class (from page 171 of the textbook), and the other using the HOARE-PARTITION procedure as follows (from page 185 of the textbook). Please note that the HOARE-PARTITION procedure does NOT do and return the same thing as the PARTITION procedure. PARTITION(A, p,r) HOARE-PARTITION(A, p, r) 1 = A[r] 1 = A[p] 2 i=p-1 2 i =p - 1 3 for j =p to s -1 3 j=r +1 4 if A[j] = x 4 while TRUE 5 i i=i+1 5 repeat 6 swap A[i] with A[j] 6 j =j-1 7 swap A[i+1] with A[r] 7 until A[j] 2 11 if i