Warehouses $A,B,$ and $C$ have $20,25,$ and $30$ units of a certain commodity, respectively. Customers V$,$ W$,$ X$,$ Y$,$ and Z have respective demands of $15,20,12,10,$ and $18$ units of this commodity. The costs per unit to ship this commodity from each warehouse to each customer are given in the table below:

$\backslash$table$[[,$V$,$W$,$X$,$Y$,$Z$,$Supply$],[$A$,{?}^2,{?}^2,{?}^5,10,,],[$B$,1,{?}^8,{?}^6,{?}^3,,],[$C$,7,,,,,],[\backslash$table$[[$Deman$],[$d$]],,,,,,],[,,,,,,]]$

Fill the table and find how can all of these demands be met from these warehouses at minimum total cost?$($Use transportation problem methods$)$