Search for question
Question

(3 points) 5. Suppose a city has a network of one-way streets such that the number of vehicles per hour flowing into all of the intersections equals the number of

vehicles flowing out, as indicated in the diagram below. The flow of traffic between each intersection is represented by the segments X,Y, Z, and W : (a) Find the general solution to the system representing the traffic flow around the four intersections:Mas (b) Determine the maximum number of vehicles per hour that can travel along the streets labeled X, Y, Z, and W :

Fig: 1

Fig: 2

Fig: 3

Fig: 4