Explain each answer

9. You have N elements equally distributed in K lists sorted in ascending order. Further the K lists are initially sorted in ascending order as well (based on the minimum element present at the start of each list). However, there is no guarantee of the relative values of the elements in the K lists below the current top of each list. Assuming no extra data structure is built: a) What is the tightest big-oh notation for removing the smallest element? b) What is the tightest big-oh notation for re-sorting the K lists once the smallest element of one of the lists is removed? What is tightest big-oh notation for removing all N elements? c) the best possible case. NOTE: Provide appropriate justification on when you might be able to see the best case. a) 100 b) 4950 c) 99 d) 98