Question textmax-flow model: assigning parcels to delivery vans A courier company has several parcels that need to be delivered during the morning shift. Each delivery van can carry up to a certain number of parcels, depending on its size and route. Each parcel can be assigned to at most one van. A van can only carry a parcel if that parcel's destination lies on the van's route. The aim is to assign as many parcels as possible to suitable vans. [table] van | parcels it can deliver a | p3 b | p2 c | p1, p2, p4 [/table] [table] van | maximum number of parcels a | 2 b | 2 c | 4 [/table] The following directed graph shows a max-flow network modelled to assign as many parcels to suitable vans as possible. The source is s and the sink is t. The diagram deliberately shows all possible directed edges from vans to parcels. You may need to give some edges a capacity of 0. For max-flow, this is equivalent to an edge not being in the graph. s a b c p1 p2 p3 p4 t source vans parcels sink For each directed edge below, enter its capacity. [table] edge | capacity s → a | Answer 1 Question 3 s → b | Answer 2 Question 3 s → c | Answer 3 Question 3 a → p1 | Answer 4 Question 3 a → p2 | Answer 5 Question 3 a → p3 | Answer 6 Question 3 a → p4 | Answer 7 Question 3 b → p1 | Answer 8 Question 3 b → p2 | Answer 9 Question 3 b → p3 | Answer 10 Question 3 b → p4 | Answer 11 Question 3 c → p1 | Answer 12 Question 3 c → p2 | Answer 13 Question 3 c → p3 | Answer 14 Question 3 c → p4 | Answer 15 Question 3 p1 → t | Answer 16 Question 3 p2 → t | Answer 17 Question 3 p3 → t | Answer 18 Question 3 p4 → t | Answer 19 Question 3 [/table] Check Question 3Multiple fill-in-the-blank