We are given two integers 1 Sk Sn and an array A of length n. For every integer i in [k, n], let b; be the k-th smallest number in A[1...]. The goal of the problem is to output bk, bk+1, bk+2, ..., bn in O(n log n) time. For example, if k 4, n = 10 and A = (50, 80, 10, 30, 90, 100, 20, 40,35, 70). Then b4 = 80,65 = 80,56 = 80,67 = 50, bg = 40, bg = 35,610 = 35. Hint: use the heap data structure