Exercise 1. (30 points) Consider a school district with I neighborhoods, J schools, and G grades at each school. Each school j has a capacity Cjg for grade g. In each neighborhood i, the student population of grade g is Sig. Finally the distance of school j from neighborhood i is dij . Formulate a integer programming problem whose objective is to assign all students to schools, while minimizing the total distance travelled by all students