In a digital game, there are three characters: one hero and two villains. The programming is done in such a way that the hero will always be attacked by the villain closest to him. One way to ``confuse'' the villains is to move the hero along trajectories that keep him equidistant from the villains, creating uncertainty between them, and thus preventing him from being attacked. For the programming of one of the stages of this game, the programmer considered, in the Cartesian plane, the square STUV as the region of movement of the characters, where V and $T$ represent the fixed positions of the villains, and $S$, the initial position of the hero, as shown in the figure. What is the equation of the trajectory along which the hero can move without being attacked? (A) $y = -3x + 20$ (B) $y = -3x + 16$ (C) $y = -3x - 20$ (D) $y = 3x + 16$ (E) $y = 3x - 16$
In a digital game, there are three characters: one hero and two villains. The programming is done in such a way that the hero will always be attacked by the villain closest to him. One way to ``confuse'' the villains is to move the hero along trajectories that keep him equidistant from the villains, creating uncertainty between them, and thus preventing him from being attacked.
For the programming of one of the stages of this game, the programmer considered, in the Cartesian plane, the square STUV as the region of movement of the characters, where V and $T$ represent the fixed positions of the villains, and $S$, the initial position of the hero, as shown in the figure.
What is the equation of the trajectory along which the hero can move without being attacked?\\
(A) $y = -3x + 20$\\
(B) $y = -3x + 16$\\
(C) $y = -3x - 20$\\
(D) $y = 3x + 16$\\
(E) $y = 3x - 16$