The 2-D (i.e. (x,y)) graph of a problem, which requires x to be an integer between 3 and 7 (inclusive on both ends) and y to be an integer between 2 and 9 (inclusive on both ends) has a feasible region of 28 dots. of 40 dots. of two vertical stripes. of infinitely many dots. of two horizontal. A school bus driver picks up 15 students from the school, drops them off at their homes (they all live in different parts of town) and drives back to the school. If he wants to minimize the total distance he drives, he'd be solving a(n): Set Covering Problem Assignment Problem Shortest Route Problem Maximal Flow Problem Traveling Salesman