please help answer all parts as this is technically only one question

0 V A motorist needs to visit a total of 6 cities over the course of the next few days and wants to minimize the total distance driven to visit all 6 cities. The distances between each pair of cities is given in the matrix below, and each city has been given a number between 0 and 5 for planning purposes. The motorist needs to start and finish in City 0. The motorist has set up the problem as a "traveling salesperson problem" in Solver. The decision variables are in 091:095 and the objective function is given in cell P97. Answer the following questions regarding this problem and its setup in Solver. M N o o P Q R S T U U w Y 87 88 Distances between cities 89 Index # 90 From To Distance INDEX 0 1 2 3 4 91 0 40 0 9999 40 30 50 60 20 92 1 2 30 1 40 9999 10 60 30 2 3 40 2 30 30 9999 40 25 60 3 60 3 50 10 40 9999 60 40 95 4 60 60 25 60 9999 40 96 5 0 20 5 20 30 60 40 40 9999 Total 230 98 5 1 30 93 94 4 5 40 4 97 What formula is in cell N93? Enter the entire formula, including the equal sign. What is the formula in cell P97? Enter the entire formula, including the equal sign. What is the name of the function used in cell P95? Just give the function name with no equals sign, parentheses, or arguments. What is the first argument of the function used in cell P95? Use relative addressing for any cell/range addresses. What is the third argument of the function used in cell P95? Use relative addressing for any cell/range addresses