data structure using java (not c++)

Given the following array: 170, 190, 129, 14, 12, 17, 78, 113, 11, 225, 37, 19, 197 What will be the array contents looking like in the following situations: 1) after calling the partition method three times in quick sort if pivot is the last element. 2) after the third iteration of the outer loop in insertion sort. 3) in bucket sort, after the array is put into buckets and the sort buckets loop starts show how array elements are organized in buckets after the third iteration of the loop that sorts buckets if this loop sorts buckets using selection sort