Graphing the constraints of a linear programming problem shows the consecutive vertices of the region of feasible points to be (0, 0), (12, 0), (10, 7), (0, 5), and (0, 0). What are the maximum and minimum values of the objective function F = 2x + 5y in this region?