1. The problem involves identifying points from the given table and matching them with points labeled on the coordinate plane. 2. The table lists points with their $x$ and $y$ coordinates: - $(0, -3)$ - $(-2, 1)$ - $(1, 2)$ 3. The graph points are: - $A(-3, 1)$ - $R(-1, 2)$ - $B(2, 2)$ - $N(3, 1)$ - $T(1, -2)$ - $W(0, -3)$ 4. Match the table points to graph points by coordinates: - $(0, -3)$ matches $W(0, -3)$ - $(-2, 1)$ does not match any graph point exactly, but closest is $A(-3, 1)$ or $R(-1, 2)$; none is exact - $(1, 2)$ does not match any graph point exactly, but closest is $R(-1, 2)$ or $T(1, -2)$; none is exact 5. Since exact matches are only for $(0, -3)$ to $W$, the sets in the options must be interpreted as groups of points from the graph. 6. The options are: - a. A, R, B - b. A, T, N - c. W, R, B - d. W, T, B 7. From the table points, only $W$ matches exactly. So options with $W$ are c and d. 8. The table points are $(0, -3)$, $(-2, 1)$, and $(1, 2)$. The graph points with $y=1$ are $A(-3,1)$ and $N(3,1)$, and with $y=2$ are $R(-1,2)$ and $B(2,2)$. 9. Since $(-2,1)$ and $(1,2)$ do not exactly match graph points, the closest matches are $A$ or $N$ for $y=1$ and $R$ or $B$ for $y=2$. 10. Therefore, the best matching set from the options for the table points is option c: $W, R, B$. Final answer: Option c. $W, R, B$