write smallestK method to find the smallest k using quicksort partition method. Note: Don't sort the array.

for example: int [] arr = {4,1,7,9,2,8);

k = 3;

the smallestK method will return 4

call this method partition(int[] array, int low, int high) to get int smallestK (int[] array, int k).