Suppose that you wanted to maintain the index of the item with the smallest value in a max heap. That is, in addition to a get Top operation, you might want to support a get Min operation. How difficult would it be to maintain this index within the add and remove operations?