Consider the office layout shown below and the accompanying trip and distance matrices.

Interdepartmental Trips per Day

$\backslash$table$[[,(2),(3),(4),(5),(6),(7),(8)],[(1),10,2,1,3,10,4,12],[(2),,7,2,5,5,8,5],[(3),,,3,14,3,11,12],[(4),,,,19,12,6,3],[(5),,,,1,2,1,],[(6),,,,,3,11,],[(7),,,,,,8,]]$

Distances between Departments $($meters$)$

$\backslash$table$[[,(2),(3),(4),(5),(6),(7),(8)],[(1),15,30,45,10,20,35,50],[(2),,15,30,20,10,20,35],[(3),,,15,40,20,10,20],[(4),,,,60,50,30,10],[(5),,,,10,30,50,],[(6),,,,,20,40,],[(7),,,,,,20,]]$

Determine the total distance traveled per day. Do not round intermediate calculations. Round your answer to the nearest whole number meters

Determine the layout that results in a lower total distance traveled per day. Do not round intermediate calculations. Round your answer to the nearest whole number.

If you switch departments the total distance traveled per day will lower to meters.