Write the python code: the maximum profit problem is the same as the minimum negative cost problem. We worry about negative cycles, but if the graph is acyclic, will negative costs (i.e., profits) ever cause a problem? Formulate and solve with your topo-shortest-path algorithm.

4.2. Beverly owns a vacation home in Cape Cod that she wishes to rent for the period May 1 to August 31. She has solicited a number of bids, each having the following form: the day the rental starts (a rental day starts at 3 p.M.), the day the rental ends (checkout time is noon), and the total amount of the bid (in dollars). Beverly wants to identify a selection of bids that would maximize her total revenue. Can you help her find the best bids to accept? Bid Start End NightsPrice 581 1149 1406 1129 1701 1136 2245 2829 1140 1429 865 1419 1120 574 1401 1973 866 1129 1122 4 4 12 12 16 18 16 17 16 20 21 20 24 30 28 29 31 10 4 12 12 13 15 17 18 19 23 25 25 27 10 12 13 14 15 16 17 18 19 20 7 4 4.2. Beverly owns a vacation home in Cape Cod that she wishes to rent for the period May 1 to August 31. She has solicited a number of bids, each having the following form: the day the rental starts (a rental day starts at 3 p.M.), the day the rental ends (checkout time is noon), and the total amount of the bid (in dollars). Beverly wants to identify a selection of bids that would maximize her total revenue. Can you help her find the best bids to accept? Bid Start End NightsPrice 581 1149 1406 1129 1701 1136 2245 2829 1140 1429 865 1419 1120 574 1401 1973 866 1129 1122 4 4 12 12 16 18 16 17 16 20 21 20 24 30 28 29 31 10 4 12 12 13 15 17 18 19 23 25 25 27 10 12 13 14 15 16 17 18 19 20 7 4