N containers c1, c2, ..., cn of several varieties of fruits to ship. Each container has different cost and depreciation expense. Initial value of each container is v1, v2, ..., vn and depreciation expense is given by d1, d2, ..., dn. Daniel has only one ship, so he can transport only one container at a time. Therefore, if container ci happens to be in the j-th shipment, its value will depreciate to /( ∗ ). Can you help Daniel to ship all containers and maximize total value of containers after depreciation? Provide proof of correctness and state the complexity of your algorithm.