Based on the cost information given in the table below, which set of job$-$machine pairs reflects the minimum$-$cost solution using the Assigniment method?

$\backslash$table$[[,$Machine$],[$Job $1,$A$,$B$,$C$],[2,30,0,0],[3,3,6,4],[3,2,4,0]]$

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

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

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

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

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