Consider that you are working for a delivery service, where you can go to the warehouse and pick items to deliver. each item i has a cost and weight ci, as well as the address to where to deliver. you have a limit w on how much weight your van can carry. for every item you deliver, you earn 10% of its cost you are also provided with a map of the town with all the possible of addresses of the items in the warehouse, and the distances between them. every mile you travel costs you $1. for simplicity you can consider the items are packaged and cannot be divided further. also there is a direct path between all pairs of addresses, although the distances may differ. each address receives exactly one item. 1. develop an algorithm, where given the list of items, their weights, costs and delivery ad- dresses, you can select the items to pick for 1trip, that brings you maximum profit. clearly explain the algorithm in english (stepl, ) and demonstrate how it works for an example problem (20+20=40) 2. implement the algorithm and try it on 5 different set of inputs. each input consists of a list of items and a complete graph of addresses, along with their distance. there should be at least 200 items on the list and 200 addresses. submit your code and your results (20+20=40)