Acollege is currently accepting students that are both in-state and out-of-state. they plan to accept three times as many in-state students as out-of-state, and they only have space to accept 100 out-of-state students. let x = the number of out-of-state students and y = the number in-state students. write the constraints to represent the incoming students at the college.

The constraints for the incoming students is written as:

x ≥0, y ≥ 0

 x =  3 y

 x  + y  = 100

Step-by-step explanation:

Let x = the number of out-of-state students

and y = the number in-state students.

Now, number of out state students accepted = 3 times ( In state students)

⇒  x =  3 y

Also, total number of students accepted   = 100

So, Number of instate + out state students = 100

⇒  x  + y  = 100

Now,as x and y are the number of students, so x ≥0, y ≥ 0

Hence, the constraints for the incoming students is written as:

x ≥0, y ≥ 0

 x =  3 y

 x  + y  = 100

Givens:

The problem says that the college is planning to accept three times as many in-state students as out-of-state students. This is represented by the equation:

Also, the problem states that they only have space to accept 100 out-of-state students, this means that has to be restricted:

These means that the maximum amount of out-of-state students are 100, this also means that the maximum in-state students are 300, because the college is planning to have three times of these students.

At last, the final restrictions would be , because the number of students cannot be negative, it wouldn't make sense, we cannot say "there are -3 students".

Therefore, all restrictions are:

there will be 35 boys in each team. : )

it would be:

c.parallelogram.