Make this into a java program

QUESTION: In the sequence= 7 19 736 20 7 4, after the completion of the partition (in Quick Sort), the index of division is ? Answer: Given: 1. array = 7 19 7 3 6 20 7 4 2. Left index = 0 3. Right index = 7 Process: 1. Pivot is the number 3 at the middle index 3 = (left+right)/2 = left + (right-left)/2 Note: Pivot is not changed in this practice array = 7 19 736 20 74 2. Set i = 0, j = 7 They are indices of first and last numbers. 1. Begin with i = 0, j = 7 i moves forward until number at i is greater or equal to pivot: i=0 . j moves backward until number at j is less than or equal to pivot: j= 3 Swap values at i and j. Sequence will be: 319 776 2074 Forward i one unit: i = 1; Backward jone unit: j = 2 2. Begin with i = 1, j = 2 i moves forward until number at i is greater or equal to pivot: i= 1 jmoves backward until number at j is less than or equal to pivot: j=0 3. At last i (= 1) is greater than j = (0). STOP Cut(index of partition) at i= 1(