Solve the following assignment problem for minimization :
Show Hint
The Hungarian method is iterative. You repeat the line-covering and matrix-improving steps until the minimum number of lines needed to cover all zeros is equal to the size of the matrix. At that point, you can find the unique assignment.