$1.$ Problem Description

In this task, you will create a program to assist users in planning trips in the United States by finding the shortest distances from a city to all other cities in the table below. The program will use the provided $15$x$15$ table of integers $($distances between two cities$)$ to find the shortest paths. Additionally, you are required to find the Minimum Spanning Tree $($MST$)$ for the cities

You have two options to complete this task:

Option $1$: Fork and complete the REPL $($see below$)$ to finish the program.

Option $2$: Prepare your solution on paper or using a text editor, documenting all steps in detail. Convert your solution into a PDF document. Ensure that your solution includes all necessary details to avoid point deductions.