Meiju.Video Autigers.org This question is kind of hard for me. Please do this question with caution. Thank you very much.

Thanks again.

(8. 5pts) Computational problem solving: Proving Correctness Let A be an algorithm that finds the kth largest of n elements by a sequence of comparisons. Prove by contradiction that A collects enough information to determine which elements are greater than the kth largest and which elements are less than it. In other words, you can partition the set around the kth largest element without making more comparisons