(3 points) Touche Young has three auditors. Each can work as many as 161) hours during the next month. during which time three projects must be completed. Project 1 will take 135 hours; project 2, 150 hours; and project 3, 155 hours. These values have changed to avoid alternate optimal solutions caused by degeneracy. Because of varying specialties. the auditors are billed at dilTerent houny rates per project Auditor 1 can be billed at120l152l190 for each hour of project 1 2 E 3 Auditor 2 can be billed at140i130i120 for each hour of project 1 i 2 r 3 Auditor 3 can be billed at 160! 140i 150 Tor each hour of project 1 i2! 3 Unused Auditor time will be assigned to a fourth inhouse project at hourly rates of $0 (ie. a dummy project that will make it a balanced transportation problem) Formulate a balanoed transportation problem (each Auditor is a supplier) to maximize total billings dunng the next month. (maximize just means we pivot on largest negative rowt) values) Find the optimal tableau. Each 2U matrix iS the relevant square in the tableau. (For grading convenience, in bottom right comer of each box use 1 for "B" and O for "N") 70 40 S1: 50 60 322 332