Solve the Following Assignment Problem Using the Hungarian Method

Essay

Solve the following assignment problem using the Hungarian method. No agent can be assigned to more than one task. Total cost is to be minimized. $$\begin{array} { c | r r c c } && { \text { Task } } \\\text { Agent } & \text { A } & \text { B } & \text { C } & \text { D } \\\hline 1 & 9 & 5 & 4 & 2 \\2 & 12 & 6 & 3 & 5 \\3 & 11 & 6 & 5 & 7\end{array}$$