You own a food truck that is licensed to operate in six different locations, which for the purposes of this problem are simply identified by the numbers 0 through 5. You are trying to decide which of these locations to operate in over the next 10 days. On day 1, you are already committed to operate in location 0. At the end of each day, you can move to one of the other locations, and after day 10 you must move back to location 0. The file food-truck-preamble. py on Canvas defines two arrays: the array moveCost is set up so that moveCost[i, j] contains the cost of moving from location i to location j. This array contains 0 wherever i is equal to j since there is no moving cost if you remain in the same location on two consecutive days. The array operatingProfit is set up so that operatingProfit[t, i] contains the predicted operating profit from operating in location i on day t (where i runs from 0 to 5 and t runs from 1 to 10). Your program should find the most profitable way to operate over the next 10 days, calculated as total operating profit minus all moving costs. It should print the optimal profit and location in which the truck spends each day.