This is a network of streets. The hourly flow of cars into this network's entrances, and out of its exits can be observed, as shown in the figure. (Note that to reach Jay, a car must enter the network via some other road first, which is why there is no 'into Jay' entry in the table. Note also that over a long period of time, the total in must approximately equal the total out, which is why both rows add to 235 cars.) Once inside the network, the traffic may flow in different ways, perhaps filling Willow and leaving Jay mostly empty, or perhaps flowing in some other way. Determine the restrictions on the flow inside this network of streets by witting up a variable for each block, establishing the equations, and solving them. Notice that streets in this readflow are one-way only. ( Hint: Set up one variable for each block, so, you will have seven variables. Each intersecting point should have equal into and out of cars, so you will haw six equations. This will not yield a unique solution, since traffic can flow through this network in various ways; you should get at least one free variable.) Suppose that some construction is proposed for Winooski Avenue East between Willow and Jay, so traffic on that block will be reduced. What is the least. amount of traffic flow that can be allowed on that block without disrupting the hourly flow into and out of the network?