4. A realtor would like to maximize the number of apartments sold. She has p apartments to sell and q potential customers for these apartments. She has m salesmen working for her. Each salesman is assigned a list of apartments and clients interested in these apartments. A salesman can sell an apartment to any of his customers. Salesman i can sell at most b; apartments. Also, any apartment cannot be owned = 2, p = 4, q = 5, b1 = 3, b2 1, and the following assignments of by more than one person. For m = customers and apartments to the salesmen, construct the flow network for the underlying problem. How to find the maximum number of apartments that can be sold? (Hint: How can you constrain that salesman i can sell at most b; apartments in this flow network?) Salesman Customers Apartments 1, 2, 3 1, 2, 3, 4 3, 4, 5 3, 4