Find a function whose domain is the set of all integers and whose target is the set of all positive integers that satisfies each set of properties. Note that we are looking for a different function for each of the following: (a) Neither one-to-one, nor onto. (b) One-to-one, but not onto. (c) Onto, but not one-to-one. (d) One-to-one and onto.

answer:   rlly

step-by-step explanation:

i believe the answer is the polygon, heptagon.

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!

care to share were the trapezoid shown is ?