if you could answer this! its the same questions just different numbers. ignore the things filled in already. thank you so much

The Hills County, Michigan, superintendent of education is responsible for assigning students to the three high schools in his county. He recognizes the need to bus a certain number of students, for several sectors, A-E, of the county are beyond walking distance to a school. The superintendent partitions the county into five geographic sectors as he attempts to establish a plan that will minimize the total number of student miles traveled by bus. He also recognizes that if a student happens to live in a certain sector and is assigned to the high school in that sector, there is no need to bus him because he can walk to school. The three schools are located in sectors B, C, and E. The accompanying table reflects the number of high-school-age students living in each sector and the distance in miles from each sector to each school: Distance to School Sector School in Sector School in Sector School in Sector Number of Students 700 500 12 100 800 400 2.500 Total Each high school has a capacity of 900 students. You have been asked to develop a linear programming model so as to minimize the total number of student miles traveled by bus Decision variable X, Number of students living in sector traveling to school located in sector) The number of decision variables for the model : Minimize Z= Subject to: 7 XAB +5 XAC +6 XAE + 0 XBB +4 Xc + 12 XBE + 4 XcB +0 Xcc +7Xce + 5 XDB +4 Xoc +7 XDE+ 12 XEB+ 7 XEC + OXEE XAB+XAC + XAE = 800 number of students in sector A XBB +XB +XBE = 600 number of students in sector B XcB+Xcc + XCE = 400 number of students in sector C XDB + Xpc + XDE = 1000 number of students in sector D XEB + XEC + XEE = 700 number of students in sector E XAB + XBB + XCB + XDB + XEB S 1,200 school B capacity XAC + XB + Xcc + Xpc + XEC 31,200 school C capacity XAE + XBE + XCE + XDE + XEE S1,200 school E capacity For all Xij 20 non negativity condition b) Using a computer software for solving LP, the objective value at the optimal solution achieved is: Minimum number of total miles traveled (objective value) = (round your response to a whole number)