1 Achliopolis Vegan Hotdog Mogul Your algorithm to achieve maximum wisdom was perfect. You achieved enough wisdom to realize that knowledge is a poor substitute for cold hard cash. You have decided to capitalize on your Achliopolis vegan hot-dog eating champion fame and open up a chain of vegan hot-dog restaurants all over Achliopolis. Luckily for you, Bens Wing Shack, an unpopular local chain, has recently gone under. As a result you have acquired n different restaurant locations and k supply warehouses. You now have to determine which warehouse will supply each restaurant. If a restaurant r is more than m miles from warehouse w, then r cant have w as its supplier; those vegan hot dogs will rot during transport! Additionally, each warehouse only stores enough vegan dogs at any given time to be the supplier of at most c restaurants. Given the number and positions of restaurants and warehouses, m, and c, construct a polynomial time algorithm that determines whether there is an assignment of restaurants to warehouses such that no warehouse supplies more than c restaurants and no restaurant is supplied by a warehouse more than m miles away

Please use a network flow algorithm