Question 2: A common task in day-to-day operations is to find the k-th smallest element in a givendata structure, be it an array or a list. A typical way of completing this task is to sort the array andthen get the k-th element. The former takes at least O(nlogn) time, where n is the size of the array,and the latter takes constant time. Therefore, the total complexity is O(nlogn).A better solution is to take advantage of heaps, which takes O(logn) time to insert an element. Tosimplify your implementation, you will use the Java built-in priority queue (with heaps as theunderlying data structure) to find the k-th smallest element in a given array. The general idea is tobuild a heap for the first k elements in the array and then for the rest of the (n - k) elements, compareeach of them with the root of the heap (i.e., the largest number in the heap) - if the element issmaller than the root, remove the root and insert the element into the heap. Repeat this processuntil the array is exhausted. In the end, your heap will hold the smallest k elements with the rootbeing the largest - it is also the k-th smallest of the array. Since the height of the heap is alwayskept at k, inserting an element takes no more than O(logk) time. In the worst-case scenario, youwould end up comparing and inserting (n- k) elements into the heap while maintaining its height.Accordingly, the total operation takes no more than O(nlogk) time- faster than O(nlogn).Step 1 - Create the method findKthSmallest which takes as parameters an int arraynumArray and an int k.The Java built-in priority queue implementation prioritizes the smallest element in thequeue. However, we could invoke the method reverseOrder from the interfaceComparator to reverse the priority.You can use a PriorityQueue to store elements that are smaller than or equal to thek-th smallest element by traversing numArray starting after the k-th index to find thesmallest elements.The k-th smallest element should be first in the queue if we reverse the order of thePriorityQueue.Step 2- Create a test driver to verify your implementation and use the jGRASP plugin to visualizehow the priority queue evolves.Sample test driver code:int[] myArray = (7, 4, 6, 10, 9, 1, 20);int x = 4;" + kSystem.out.println ("ThefindKthSmallest (myArray, k));"thsmallest element is:Sample Output:The 4th smallest element is: 7

Question

Question 2: A common task in day-to-day operations is to find the k-th smallest element in a givendata structure, be it an array or a list. A typical way of completing this task is to sort the array andthen get the k-th element. The former takes at least O(nlogn) time, where n is the size of the array,and the latter takes constant time. Therefore, the total complexity is O(nlogn).A better solution is to take advantage of heaps, which takes O(logn) time to insert an element. Tosimplify your implementation, you will use the Java built-in priority queue (with heaps as theunderlying data structure) to find the k-th smallest element in a given array. The general idea is tobuild a heap for the first k elements in the array and then for the rest of the (n - k) elements, compareeach of them with the root of the heap (i.e., the largest number in the heap) - if the element issmaller than the root, remove the root and insert the element into the heap. Repeat this processuntil the array is exhausted. In the end, your heap will hold the smallest k elements with the rootbeing the largest - it is also the k-th smallest of the array. Since the height of the heap is alwayskept at k, inserting an element takes no more than O(logk) time. In the worst-case scenario, youwould end up comparing and inserting (n- k) elements into the heap while maintaining its height.Accordingly, the total operation takes no more than O(nlogk) time- faster than O(nlogn).Step 1 - Create the method findKthSmallest which takes as parameters an int arraynumArray and an int k.The Java built-in priority queue implementation prioritizes the smallest element in thequeue. However, we could invoke the method reverseOrder from the interfaceComparator to reverse the priority.You can use a PriorityQueue to store elements that are smaller than or equal to thek-th smallest element by traversing numArray starting after the k-th index to find thesmallest elements.The k-th smallest element should be first in the queue if we reverse the order of thePriorityQueue.Step 2- Create a test driver to verify your implementation and use the jGRASP plugin to visualizehow the priority queue evolves.Sample test driver code:int[] myArray = (7, 4, 6, 10, 9, 1, 20);int x = 4;&#34; + kSystem.out.println (&#34;ThefindKthSmallest (myArray, k));&#34;thsmallest element is:Sample Output:The 4th smallest element is: 7

Accepted Answer

I have provided  JAVA  CODE  along  with  CODE  SCREENSHOT  and  OUTPUT  SCREENSHOTS-----

Sample test driver code: int[] myArray = (7, 4, 6, 10, 9, 1, 20); int k = 4; System.out.println("The " + findKthSmallest (myArray, k)); + k + "th smallest element is: Sample Output: The 4th smallest element is:7