A transport company capable of transporting up to $20T$ of material has requests from four different stores to carry their merchandize from city $Y$ to city $Z.$ Each store can supply as much merchandize of different type as the transport company is willing to accept. The merchandize must be transported in unit amounts. The following Table gives the transportation cost.

$\backslash$table$[[$Store$,\backslash$table$[[$Weight of merchandize,$],[$T$/$ product unit$]],\backslash$table$[[$Transportation cost$,],[$Rs$/$ product unit$]]],[$A$,2,10000],[$B$,4,25000],[$C$,6,45000],[$D$,8,60000]]$

Using dynamic programming method, determine the number of units of each store's merchandize the transport company should accept to maximize the total transportation cost without exceeding its transportation tonnage capacity.