Robots want to find a location for a meeting that minimizes the sum of squared distances from their rooms to the location of the meeting. Assume for now that they can host the gathering at any location in the hallway. Assuming that the robots live in a 1-dimensional hallway, solve the following problems: Pose this problem as an (unconstrained) optimization problem. Assume there are n robots and the i-th friend is located at location li. Denote the location of the meeting by p. What is the objective as a function of p ? Write it down. If you are having trouble deriving the general case, try the n=2 case first