Use the Hungarian Method to solve the following Assignment Problem.

Consider the following management decision problem: you have 4 employees E1, E2, E3, and E4 that must be reassigned to new jobs J1, J2, J3, and J4 (which they can all "sort of" do, with different training and quality costs) - and you must decide which employee should do which job (i.e., you need to make an assignment which has the least total cost for the company). Below is the cost matrix showing what the costs would be for assigning each employee to one of the jobs. You want to minimize the total cost for an assignment of the employees each to one job,

i.e., to minimize _i (cost for Ei to do job J(i)) where (i) is the label of the job that employee i is assigned to.

	J1	J2	J3	J4
E1	75	70	73	80
E2	70	89	70	70
E3	85	70	80	76
E4	77	70	73	80