6. Three workers, Harriet, Jason and Katherine, are to be assigned to three tasks, 1, 2 and 3. Each worker must be assigned to just one task and each task must be done by just one worker.
The amount each person would earn, in pounds, while assigned to each task is shown in the table below.
| Task 1 | Task 2 | Task 3 |
| Harriet | 251 | 243 | 257 |
| Jason | 244 | 247 | 255 |
| Katherine | 249 | 252 | 246 |
The total income is to be maximised.
- Modify the table so it can be used to find the maximum income.
- Formulate the above situation as a linear programming problem. You must define your decision variables and make your objective function and constraints clear.