How does the Hungarian algorithm of assignment problem get the optimal assignment from B2?

This is to see the minimum value of the corresponding column vector (that is, 0). The minimum amount of 0 in the first column is in the second row, indicating that the first person corresponds to the second task; The minimum amount of 0 in the second column is in the first row, indicating that the second person corresponds to the first task; The third column is in the third row, and only the fourth column can be assigned, so there is an optimal assignment in the diagram.