draw a network flow algorithm graph for this:

There will be four software packages, X1, , X4.

The non-zero costs will be as follows:

b1 = 10 and b2 = 3 to buy X1 and X2. a3 = 9 and a4 = 5 to not buy X3 and X4. The additional costs w(i,j) for buying Xi but not Xj are:

W(1,2) = 5, W(3,1) = 4, W(3,2) = 4, W(4,1) = 7, w(4,2) = 3, and W₍₄,₃₎ = 2.

For any value not given, it is 0.

Input to Network Flow: The nodes in the graph/network will be consists of special nodes s and t and the four nodes X1, , X4. Your task is to add directed edges to this graph and to provide each of these edges with a capacity.