1 short recursion write a method in the recursiontester class called sort int v whi 5346821

(1) Short Recursion

Write a method in the RecursionTester class called sort(int[] v)which takes an integer array and sorts the array in increasingorder. Note that the method should sort the array given, not createany new arrays. Also, you MUST write the method recursively to getany marks. You will want to use a helper method. (Hint: Move leftto right through the array recursively, swapping a pair of elementsif the one on the left is larger than the one on the right. Use aparameter to keep track of the position of the element pair thatyou are examining. If you reach the end of the array and no itemshave been swapped, then the array is sorted now and you can stop.Otherwise, you will need to restart the swapping process from thebeginning of the array. You'll need to keep track of whether or notyou made a swap…use another parameter). It may be helpful towrite a method that will display your array, so that you can usethis for debugging. Here is an example of how to test it from amain method, assuming that you have a method called displayArray todisplay the array:

int[] v = {3, 6, 9, 2, 7, 1, 5, 8, 4, 2, 2, 1};

sort(v);

displayArray(v);