The Following Matrix Shows Relative Costs for Various Job-Machine Combinations

The following matrix shows relative costs for various job-machine combinations. Which set of pairs constitutes the minimum-cost solution using the assignment method? $\begin{array}{c} \quad\quad\quad\quad\quad{\text { Machine }} \\\begin{array}{rrrr} & \text { A } & \text { B } & \text { C } \\\text { Job 1 } & \$ 6 & 0 & 0 \\2 & 0 & 3 & 4 \\3 & 0 & 1 & 2\end{array}\end{array}$

A) 1-B, 2-C, 3-A
B) 1-B, 2-A, 3-C
C) 1-A, 2-C, 3-B
D) 1-A, 2-B, 3-C
E) 1-C, 2-A, 3-B