1. Four workers, A, B, C and D, are to be assigned to four tasks, P, Q, R and S.

Each task must be assigned to just one worker and each worker can do only one task.
Worker B cannot be assigned to task Q and worker D cannot be assigned to task R.
The amount, in pounds, that each worker would earn when assigned to each task is shown in the table below. The Hungarian algorithm can be used to find the maximum total amount that would be earned by the four workers.

1. 1. Explain how to modify the table so that the Hungarian algorithm could be applied.
   2. Modify the table as described in (a)(i).
2. Formulate the above situation as a linear programming problem. You must define the decision variables and make the objective function and constraints clear.