Please provide Excel worksheet with respective formulas, rows, and columns shown in the answer and I will rate right away. Thank you.

Question 13 Consider the following shortest path problem. What is the optimal route (i.e., the shortest) from Node 1 to Node 6. To From Node Branches Node Distance 1 1 2 150 2 1 3 200 200 3 2 4 4 2 3 50 5 4 6 100 6 4 300 350 7 | | | 5 8 5 6 100 a. Branches 1, 4, 7, 8 b. Branches 2, 7, 8 c. Branches 2, 4, 3,5 d. none of the answers proposed apply e. Branches 2, 6,5