The following matrix shows relative costs for various job$-$machine combinations. Assume there must be one$-$to$-$one matching between jobs and machines. Which set of pairs constitutes the minimum$-$cost solution using the assignment method?

Machine

A B C

Job $1$ $ $600$

$2034$

$3012$

Multiple Choice

$1-$B$,2-$C$,3-$A

$1-$B$,2-$A$,3-$C

$1-$A$,2-$C$,3-$B

$1-$A$,2-$B$,3-$C

$1-$C$,2-$A$,3-$B