Need some help figuring something out. I need to show how the procedure Initialize(A,n,k), which gives back the k smallest elements from array A, and show how it would take O(n+k log n) to run on 3 different data structure: a sorted array, an unsorted array, and a max-heap of size k?