Can I get answers for the three parts of the question?

The federation is running out of money 1. In an effort to increase revenue, the federation has decided to put toll booths on the edges of black holes; the toll will be based on the spaceship weight.(Brilliant right!) The toll booths (aka black hole locations) have been numbered h1,h2,,hn according to how close they are to federation headquarters 2 where ties are broken arbitrarily. Design a data structure and implement methods that can perform the following in O(logn) worst case time. (a) insert (d,r) Inserts a new toll booth which has a toll rate of r per ton. The new toll booth is at distance d from the federation headquarters. (b) delete(k) Deletes the kth toll booth (c) toll(i, j) Returns the average toll for booths i through j inclusive. Justify the running times of your methods