1. Based on the MaxHeap program design and Implement a min heap collection, with an appropriate interface, implementing class, and node class. Use a linked implementation strategy. Please see attahment I have copied the MaxHeap program and change its name to MinHeap for furter reference, I need help to modify the method within that program that allows me to return the smallest element.
2. Create a driver to test your implementation. Add several random elements to the heap, and then remove & display the smallest element.