For this question, time complexity has to be Theta(logn), please do not use python build in functions like .sort or please do not download or import any ready to use library.

I want you to solve this with implementing min heap and popping len(A)-k elements from list. With this way we will have k largest elements in our list.

PLEASE READ MY DESCRIPTIONS AND PLEASE DO NOT ANSWER WITHOUT THINK ON MY COMMENTS. You can ask me questions if it is not clear for you. TY

2(c) If we don't care about the original ordering, then we can use a heap to design an algorithm that runs faster than the one in part (b). Design and implement an algorithm that returns an array of the k largest elements of A using a heap. 2(c) If we don't care about the original ordering, then we can use a heap to design an algorithm that runs faster than the one in part (b). Design and implement an algorithm that returns an array of the k largest elements of A using a heap