Consider following transportation Problem

1 
2 
supply 
A 
5 
6 
100 
B 
4 
2 
200 
C 
3 
6 
150 
D 
9 
7 
50 

250 
250 

prepare down the complete linear programming model (All three parts) to find out the number of items to be transported from models A, B, C, and D to nodes 1 and 2 at minimum cost. You don't have to solve the problem.