Consider the set A of all integers from 0 to 399 inclusively; all numbers are written in three-digit format (so instead of 0 we write
000, instead of 17 we write 017 etc.). Two distinct numbers from A
are said to be neighbors if they differ at exactly one place (so 007
and 017 are neighbors because they differ at exactly one place, the
tens place). What is the maximum number of different numbers
from A such that no two of them are neighbors?

Graph the system of inequalities presented here on your own paper, then use your graph to answer the following questions: y > 2x + 3y is less than negative 3 over 2 times x minus 4part a: describe the graph of the system, including shading and the types of lines graphed. provide a description of the solution area. (6 points)part b: is the point (â’4, 6) included in the solution area for the system? justify your answer mathematically. (4 points)