issue #220 fixed

Author: Kristi Nakaj

pretext/IntroRecursion/TheThreeLawsofRecursion.ptx

@@ -29,7 +29,7 @@
             algorithm our primary data structure is a list, so we must focus our
             state-changing efforts on the list. Since the base case is a list of
             length 1, a natural progression toward the base case is to shorten the
-            list. This is exactly what happens on line 5 of <xref ref="intro-recursion_calculatingthe-sumofa-listof-numbers"/> when we call <c>listsum</c> with a shorter list.</p>
+            list. This is exactly what happens on line 5 of the ActiveCode in <xref ref="intro-recursion_calculating-the-sum-of-a-list-of-numbers"/> when we call <c>listsum</c> with a shorter list.</p>
   <p>The final law is that the algorithm must call itself. This is the very
             definition of recursion. Recursion is a confusing concept to many
             beginning programmers. As a novice programmer, you have learned that