The distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2: Click on the datafile logo to reference the data. Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The DATAfile Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find the location to hold the wedding that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Find the optimal location. Hint: Notice that all longitude values given for this problem are negative. Make sure that you do NOT check the option for Make Unconstrained Variables Non-Negative in Solver. If required, round your answers to two decimal places. For subtractive or negative numbers use a minus sign even. (Example: -300) Latitude of the optimal wedding location = Longitude of the optimal wedding location = Total demand-weighted distance =