customers are given in the following table.

$\backslash$table$[[,$Customer$],[$Cab Site,A$,$B$,$C$,$D$,],[$Stand $1,7,3,4,8,],[$Stand $2,5,4,6,5,],[$Stand $3,6,7,9,6,],[$Stand $4,8,6,7,4,]]$

The optimal assignment of taxis to customers that minimizes the distance is:

Customer $A,$

Stand $1$

Stand $2$

Stand $4$

Stand $3$