You write a computer animation program to help young children learn the alphabet. The program draws a letter, erases the letter, and makes it reappear in a new location two times. The program uses the following composition of translations to move the letter.
(x,y)->(x+5,y+7) followed by (x,y)->(x-9,y-2)
Suppose the program makes the letter W by connecting the points (1,2),(2,0),(3,2),(4,0) and (5,2). What points does the program connect to make the last W?
