can you verify if my answers are correct?

You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. You can formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. In your network representation, how many arcs are associated with node for city C? Continue with the previous shortest path problem, formulate it as a LP and use software to solve it. What is shortest distance from origin to the destination? Write your answer as integers. A Question 3 (10 points) Saved Continue with the previous shorted path problem, use the Dijkstra's algorithm to solve it manually by hand. Is your answer the same as the one that found by the software? True False Question 4 (10 points) Saved Continue with the previous shortest route problem, analyst Cindy claims that the shortest route will not change if each number in the distance table represents your time (in minutes) for driving your car from one town to the next. Is her statement True or False? True False