Problem 6: (10 points) You may use either a Word document or Excel for this problem. Name the Word or Excel file as follows: Your last name_Problem6. For example, your instructor would name it as follows: Jance_Problem6. You are given the following network diagram. Use the minimal spanning tree algorithm to determine the arcs that will connect all the nodes at the lowest cost. Start at Node 1. 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) Problem 6: (10 points) You may use either a Word document or Excel for this problem. Name the Word or Excel file as follows: Your last name_Problem6. For example, your instructor would name it as follows: Jance_Problem6. You are given the following network diagram. Use the minimal spanning tree algorithm to determine the arcs that will connect all the nodes at the lowest cost. Start at Node 1. 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) .
Problem 6: (10 points) You may use either a Word document or Excel for this problem. Name the Word or Excel file as follows: Your last name_Problem6. For example, your instructor would name it as follows: Jance_Problem6. You are given the following network diagram. Use the minimal spanning tree algorithm to determine the arcs that will connect all the nodes at the lowest cost. Start at Node 1. 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) Problem 6: (10 points) You may use either a Word document or Excel for this problem. Name the Word or Excel file as follows: Your last name_Problem6. For example, your instructor would name it as follows: Jance_Problem6. You are given the following network diagram. Use the minimal spanning tree algorithm to determine the arcs that will connect all the nodes at the lowest cost. Start at Node 1. 1) Draw the optimal solution that gives the lowest cost ( 6 points). 2) What is the lowest cost? (4 points) .