Part II: Assignment Problem

$\backslash$table$[[,$Task$],[,1,2,3,4],[$Assignee$,$A$,8,6,5,7],[$B$,6,5,3,4],[$C$,7,8,4,6],[,$D$,6,7,5,6]]$

a$.$ Determine the linear programming model formulation to minimize the total assignment cost.

b$.$ Manually apply the Hungarian algorithm to find the optimal assignment, and describe it briefly in "plain English".