PLEASE SHOW IMAGES OF YOUR EXCEL SOLVER!!!!

0 Preface Each of the problems in this exam will be referencing this main mathematical problem. You will be using several methods to solve it. The Pony Express Starting in early April of 1860 , The Pony Express was a private mail service which specialized in transporting letters from the New York all the way to San Francisco and back. They used a pretty novel staging method to deliver these letters in as few as ten days! This revolutionized east-west coast communication and was somewhat popular until the first transcontinental telegraph line was completed only 18 months later. Figure 1: A rough map of major cities in the US circa 1861 weighted with the number of days might take a group of staged riders to traverse each edge. You and your computer have been have been transported back in time to September Table 1: Legend for Figure 1 \begin{tabular}{lr|l} 1861. As a fan of the Pony Express, you know & Node & City \\ \cline { 2 - 4 } that they have been operating at a loss for & s & New York City, New York \\ several months and that the first transconti- & a & St. Louis, Missouri \\ nental telegraph line will put them out of busi- & b & Yankton, The Dakota Territories \\ ness by the end of next month. Saddened by & c & Omaha, The Nebraska Territories \\ this knowledge, you set out to change the past & d & Salt Lake City, The Utah Territories \\ by optimizing the route used by the Pony Ex- & t & San Francisco, California \end{tabular} pross. Problem Statement Find the route from New York City to San Francisco which takes the fewest number of days to traverse. That is, find the shortest path between nodes s and t on the graph in Figure 1. Problem 2 Excel Solver. Solve this problem in Excel Solver. 0 Preface Each of the problems in this exam will be referencing this main mathematical problem. You will be using several methods to solve it. The Pony Express Starting in early April of 1860 , The Pony Express was a private mail service which specialized in transporting letters from the New York all the way to San Francisco and back. They used a pretty novel staging method to deliver these letters in as few as ten days! This revolutionized east-west coast communication and was somewhat popular until the first transcontinental telegraph line was completed only 18 months later. Figure 1: A rough map of major cities in the US circa 1861 weighted with the number of days might take a group of staged riders to traverse each edge. You and your computer have been have been transported back in time to September Table 1: Legend for Figure 1 \begin{tabular}{lr|l} 1861. As a fan of the Pony Express, you know & Node & City \\ \cline { 2 - 4 } that they have been operating at a loss for & s & New York City, New York \\ several months and that the first transconti- & a & St. Louis, Missouri \\ nental telegraph line will put them out of busi- & b & Yankton, The Dakota Territories \\ ness by the end of next month. Saddened by & c & Omaha, The Nebraska Territories \\ this knowledge, you set out to change the past & d & Salt Lake City, The Utah Territories \\ by optimizing the route used by the Pony Ex- & t & San Francisco, California \end{tabular} pross. Problem Statement Find the route from New York City to San Francisco which takes the fewest number of days to traverse. That is, find the shortest path between nodes s and t on the graph in Figure 1. Problem 2 Excel Solver. Solve this problem in Excel Solver