Find the maximum or minimum value of the given objective function of a linear programming problem. The figure
illustrates the graph of feasible points. 
-z = -x - 8y. Find maximum.
Definitions:
Q21: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)x = 3,
Q72: {(7, 2), (5, 3), (3, 4), (1,
Q83: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)
Q92: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)0 B)1 C)-1
Q140: Suppose that <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt="Suppose that
Q185: f(x)= 4x + 16, g(x)= <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg"
Q269: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)
Q273: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)x = 0.64,
Q284: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)x = 3,
Q299: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8253/.jpg" alt=" A)