You are hired to the rebels fight the evil empire in star wars the rebels have n space ships and each space ship i (1 ≤ i ≤ n) has a certain power pi . moreover, the empire has m bases where each base j (1 ≤ j ≤ m) has a defensive power di and gold gi . you know that each space ship can attack every base with defensive power strictly smaller than the ship’s own power and collect its golds. the rebels need to know that, for each of their space ships, what is the maximum amount of gold this spaceship can collect. design an algorithm with running time o((n+m)·log m) for this task.