A construction contractor wants to establish the subcontract plan for greening a park area. The tasks for which he requested work proposals are: debris removal, general cleaning of common areas, painting, roof sealing and landscaping work. The following table shows the amounts, in thousands of dollars, that each service group that submitted its work proposal, by task. In the table, boxes with an asterisk (*) indicate that the contractor does not want to hire that company for the particular task, for quality reasons or because the subcontractor does not provide that service. In the column "maximum capacity", the maximum number of tasks that can be assigned to each company is shown.

Formulate this problem as an allocation problem where you want to minimize subcontract costs. Then solve using the Hungarian Method / algorithm.

Company Max capacity debris cleaning areas I gardening work sealing removal x $1003 x $1000 x $1000 . X$1000 x $1000 3.5 0.8 1.6 8 3 A 2 B 2.85 L L 2.8 2.1 1.4 7.d