Problem $1-$Min Product Travel

Method

Among the layout alternatives given below, suggest the layout as per the "Minimum Product Travel method". Consider each department to be of $10$ sq$.m$ and diagonal movements are not permitted $($eg$.$ Movement between $8$ and $1$ is not permitted, you need to travel around the other departments to reach the other$).[7]$

$\backslash$table$[[$Layout $1,$Layout $2],[,,,,,,,,,,],[3,8,6,4,9,,4,6,8,2,10],[,,,,,,,,,,],[10,7,1,5,2,,3,1,5,9,7]]$