A new manufacturing facility needs to serve several retailers, represented as vertices in the tree diagram below. The retailers are connected by roads and the flow for each is represented by triangles in the diagram. Where should the new manufacturing facility be located such that the total flow from the manufacturing facility to the retailers is minimized? Use the Chinese algorithm. (Note that the vertex/vertices with flow = 0 are included for convenience for use with the algorithm.)

A new manufacturing facility needs to serve several retailers, represented as vertices in the tree diagram below. The retailers are connected by roads and the flow for each is represented by triangles in the diagram. Where should the new manufacturing facility be located such that the total flow from the manufacturing facility to the retailers is minimized? Use the Chinese algorithm. (Note that the vertex/vertices with flow = 0 are included for convenience for use with the algorithm.) 4 1 1 2 3 2 6 4 5 6 7 9 0 10 8 8 5 A new manufacturing facility needs to serve several retailers, represented as vertices in the tree diagram below. The retailers are connected by roads and the flow for each is represented by triangles in the diagram. Where should the new manufacturing facility be located such that the total flow from the manufacturing facility to the retailers is minimized? Use the Chinese algorithm. (Note that the vertex/vertices with flow = 0 are included for convenience for use with the algorithm.) 4 1 1 2 3 2 6 4 5 6 7 9 0 10 8 8 5