Please help ASAP! needed in 60 mins

additional help: X={1,2,4,5} with w_1=0, w_2=8, w_4=7, and w_5=5" may not necessary to be the shortest path. Those are the middle steps for the shortest path algorithm. Those weight values (w), indicating the minimal weight of the path from node 1 to the node in the current stage, can be updated and changed later if new preceding nodes are found.

X={1,2,4,5} is a node-set. It is NOT shortest path. "If the travel time between node 1 and node 2 is 9, what is the travel time between node 2 and node 4? (No credit for no explanation)" can be changed as "If the travel time between node 1 and node 2 is 9, what is the travel time between node 4 and node 2? (No credit for no explanation)"

3. (4 points = 2+2 points) Consider the following road network, where you want to find the path from node 1 to node 6 that minimizes the total travel time. Note that no travel time information is provided in the figure. Furthermore, travel times are not proportional to the length of the arcs shown below. You decided to use the shortest- path algorithm to find the path. After three iterations were completed, suppose that you have X = {1,2,4,5} with w = 0,w2 = 8, W4 = 7, and w5 = 5 1 5 3 4 6 2 a. If the travel time between node 1 and node 2 is 9, what is the travel time between node 2 and node 4? (No credit for no explanation) b. True or False? "Travel time between 1 and 3 is less than 8." (No credit for no explanation)