step by step method

b. Chola computing has three programming jobs to be done and four programmers available. The department manager estimates it will take the programmers the following amount of time (in hours) to compute each job (An X means cannot be assigned): Jobs B A m 15 Programmers * 6 10 5 7 9 8 8 4 7 5 i. Which programmer should be assigned to each job if management whishes to minimize total programming time spent? Use the Hungarian method. (7 Points) Which programmer will not be assigned? (1 Points)