A moving and storage company is allocating five long distance moving loads to trucks. One feasible combination covers loads 1 and 3 in a 4525-mile route; a second combines loads 2, 3, and 4 in 2960 miles; a third hauls loads 2, 4, and 5 in 3170 miles; and a fourth covers load 1, 4, and 5 in 5230 miles. Formulate and solve an integer programming problem to determine a minimum distance combination of routes covering each load exactly once.