please solve this question using java

Show what would be in the following array after the first three passes of the insertion sort algorithm (sorting in increasing order). Hint: For an n-element array, it's completely sorted after n-1 passes. array before call to insertion s 01 2345 6789 (top level shows array indices) 17 12 2 7 20 36 5418 15 array after 3 passes of insertion sort: 1 4 7