Select a starting point, \(M(2,5)\) or \(N(3,1)\), and two of the vectors \(\mathbf{a}\) to \(\mathbf{g}\) so that the sum of the vectors will get you from your start to the target, \(T(7,6)\).

How many different ways can you pair up the vectors to get to the target?

Can you add *three* of the vectors to get from one of the starts to the target?