When a feasible region is bounded on all sides, where will the maximum and minimum values of the objective function occur?

Which functions have a y-intercept that is greater than the y-intercept of the function g(x) = |x + 3| + 4? check three options. f(x) = –2 (x – 8)2 h(x) = –5 |x| + 10 j(x) = –4(x + 2)2 + 8