) Give the fastest algorithm to find the two smallest distinct integer values in a MIN heap of n integers, in which values may be duplicated, and there are at least 2 distinct values. Clearly list the sequence of steps in the algorithm. You can only manipulate the heap using its insert and delete the methods (you do not have access to the internal heap array), and you can use additional storage structure to temporarily hold deleted items. The heap must still hold all n values when your algorithm is done.    What is the worst case big 0 running time of your algorithm? Ignore the time it takes to allocate space for additional structures, if any.    ii) A max heap has 128 items. The max item is deleted, and the heap order is restored. What would be the worst case number of comparisons made between the heap items in this pro

1. i) Give the fastest algorithm to find the two smallest distinct integer values in a MIN heap of n integers, in which values may be duplicated, and there are at least 2 distinct values. Clearly list the sequence of steps in the algorithm. You can only manipulate the heap using its insert and delete the methods (you do not have access to the internal heap array), and you can use additional storage structure to temporarily hold deleted items. The heap must still hold all n values when your algorithm is done. 

What is the worst case big 0 running time of your algorithm? Ignore the time it takes to allocate space for additional structures, if any. 

1. ii) A max heap has 128 items. The max item is deleted, and the heap order is restored. What would be the worst case number of comparisons made between the heap items in this process?