2 Blood donors At the halloween party at a well-known academic institution north of Copenhagen not all went smooth and some students had to be taken to medical emergency treatment at Rigshospitalet. In total 150 had to get a transfusion of one bag of blood. The hospital had 155 bags in stock. The distribution of blood groups in the supply and amongst the students is shown in the table below. Blood type Bags in stock Demand A B AB 44 31 42 38 37 33 40 40 Type A patients can only receive blood of type A or type 0; type B patients can receive only type B or type 0; type 0 patients can receive only type 0; and type AB patients can receive any of the four types. Model the problem as a flow network problem. Draw the corresponding network, and interpret the meaning of the nodes, and edges (edges capacities). Describe an algorithm to check whether every student can get a transfusion, otherwise how many can get one. You do not have to solve the problem explicitly.