USING JAVA

(15%) TASK 6 Create the following method that, given an array of integers and a cardinal number, k, finds the kth smallest number in the array. You are not allowed to call any sorting functionality. Remember, a cardinal number starts with one; for the smallest value, k-1. Assume, there are enough items in the array to find the kth value. public static int smallest(int[] arr, int k) Examples smallest((1,1,1,3,3,4,5,5,5), 5) --> 3