A stack was implemented using the following array: 1) Update the array and point the top after the calls PUSH(3), PUSH(7), and POPQ). 2) If a queue was also implemented with an array like the above, update the array and point the head and tail after ails DEQUEUEQ, DEQUEUEQ, ENQUEUE(3), ENQUEUE(7), ENQUEUE(9), and ENQUEUE(17). Write a method to find the first k smallest elements in a set S of n distinct numbers. Prove that your method can achievt O(n) time complexity. Use the editor to format your