3. (a) (1 point) Draw the feasible region of the inequality x+y1. (b) (1 point) Express x+y1 as a system of linear constraints. 1 (c) (3 points) In an arcade video game, the player controls a character that can move either up, down, left or right but not diagonally. In each round of the gameplay, the player is shown a map marked with n stars with coordinates (a1,b1),,(an,bn). The player chooses a location (u,v) to place their character, and then a true target is revealed at one of the stars. The player moves the character from the selected location to the target, and more points are awarded if the character travels a shorter distance to the target. Since the true target is revealed after the character is positioned, a safe strategy for the player is to minimize the longest travelling distance d from the selected position to any potential target. Write a linear program that models the problem of finding the minimum value of d