Answer:
(3,3)
Step-by-step explanation:
Given


Required
Determine which can't be any of the new vertices
First, we need to determine the new vertices:

For (0,0):



For (1,0):



For (0,1):



<em>Comparing the calculated new vertices to the list of given options; (3,3) can't be any of the new vertices of the new triangle</em>
<em></em>
Answer:for the first one, you should probably do a table of values then answer the question, i usually find that helpful
Step-by-step explanation:
Answer:
C
Step-by-step explanation:
hope I'm right sorry if I'm not lol.
70,000 when a zero is in between you gonna count it