#### Answer

\begin{array}{l}{\text { This approach would not work with larger graphs such as one with } 26} \\ {\text { nodes and } 50 \text { links. The number of possible paths would grow much too }} \\ {\text { large for us to enumerate and evaluate them all in a reasonable amount }} \\ {\text { of time. We must use a more clever algorithm. }}\end{array}