Show transcribed image text Conventions used in the project: A directed weighted graph is called a network. Weights on edges in these networks will represent the capacity of the edges (the most flow per unit time). If a network has two weights on each edge (this will be a flow network), the first will represent the capacity of the edge and the second will represent the actual flow through the edge. In any network, s will represent the source and t will represent the sink. All other vertices will be called intermediate vertices. Explain why the maximum flow through the network pictured must be 6. Why is it necessary, in a flow network, for all intermediate vertices to have their inflow equal to their outflow. Fill in the missing flows (x & y) on the following network. Is the flow in the network in #3 maximal. If yes, explain why, If not, find the maximal flow. Find the maximal flow in the following network: Consider the following list of applicant/qualifications: Abel is qualified for Jobs 1, 2, 3; Boaz for Jobs 2, 5, 6; Cain for jobs 2, 3, 5; Diane for jobs 2, 4, 7; Edward for jobs 3, 5, 6;