Consider a school district with i neighborhoods, j schools, and g grades at each school. each school j has a capacity of cjg for grade g. in each neighborhood i, the student population of grade g is sig. finally, the distance from school j to neighborhood i is dij . formulate an lp whose objective is to assign all students to schools, while minimizing the total distance traveled by all students. you may ignore the fact that numbers of students must be integer.