Asmall suburban city is experimenting with a newway to keep its main park clean. From May through October, a crew is needed every day to pick up and remove trash. Rather than contracting with one company for the entire period, the city manager takes bids from firms on its website. Firms submit bids with dates of work and the fee for which the firm is willing to do the clean-up work. On some published date, the city manager reviews all of the bids submitted and decides which ones to accept. For example, a firm might make a bid to perform the work June 7–20 for $1200. Another firm might bid to work June 5–15 for $1000. Because the bids overlap, they cannot both be accepted. How can the city manager use Dijkstra's Algorithm to choose what bids to accept to minimize costs? What assumptions do you need to make?