Bailey and Jade both play basketball. The table and graph show the total number of games that each of their teams won over six weeks. A coordinate plane labeled Jade's Team. The x-axis is labeled Weeks and the y-axis is labeled Wins. Points plotted are (1, 0), (2, 1), (3, 3), (4, 5), (5, 6), and (6, 7).

Bailey’s Team
Number of weeks
Wins
1
2
2
2
3
3
4
4
5
4
6
6

After which week had the two teams won the same number of games?

the equation cos(35) =a/25 can be used to find the length of bc what is the length of bc? round to the nearest tenth

step-by-step explanation:

answer: c

(2, -4)

goes 7 to the

(9, 4)

easy

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol