Another way to specify a weight graph is to list the nodes and the arcs, where the arcs are listed as pairs of nodes. For example, the weight graph of Figure 6.2 in the textbook is: Nodes: E1, E2, E3, E4, N1, N2, N3 Arcs: (E1, N1),(E2, N2),(E3, N2),(E4, N1),(E3, N2),(N1, N2) Draw the weight graph for the following nodes and arcs. Identify any special structure (i.e. nodes can be split into separate systems, unnecessary nodes) a) Nodes: E1, E2, E3, N1, N2, N3 Arcs: (E1, N1),(E2, N2),(E3, N3),(N1, N2) b) Nodes: E1, E2, E3, E4, N1, N2, N3 Arcs: (E1, N1),(E2, N3),(E3, N1),(E4, N3),(E1, E2) Question 2: Resolve the Question from Module 5 Homework using the Minimum Cost Network Flow approach. A small factory has five existing machines located at coordinate locations P1 = (8, 25), P2 = (10, 10), P3 = (16, 30), P4 = (30, 10)andP5 = (40, 25). Two new machines are to be located in the shop. Let item movement is rectilinear. It is anticipated that there will be four trips per day between the new machines. The number of trips per day between each new machine and each existing machine is given by matrix W. What are the optimal locations for the new machines? W = 8 6 5 4 3.