Your friend john claims to have a comparison based data structure, which can support two methods: insert and extract almost min. here the extract almost min operations returns either the minimum item in the structure or second minimum and doesn’t tell you which item it returned. he further claims that both this operations can be done in o(1) time. prove that his claim is wrong! (hint: if his claim was right, show how you can use this to sort n numbers in o(n) time contradicting the sorting lower bound).