2. Given the following network: dl 6 2 O is the origin, T is the destination. a. Find the shortest path from O to T using the algorithm discussed in class (give your table of iterations). Use the arc values to represent distances. Your table should have the following information in it: N Solved connected Closest Minimum Last Distancearc Total Distance uiti nearest to unsolved unsolved b. Formulate the shortest path problem in a spreadsheet and solve it