sagemathgh-36611: fix the links to msolve spkg
    
Links to spkg msolve in the manual are currently broken, e.g. in `https:
//doc.sagemath.org/html/en/reference/polynomial_rings/sage/rings/polynom
ial/multi_polynomial_ideal.html#sage.rings.polynomial.multi_polynomial_i
deal.MPolynomialIdeal.groebner_basis` the `msolve` entry in `ALGORITHMS`
:
`https://doc.sagemath.org/html/en/reference/polynomial_rings/sage/rings/
spkg/msolve.html` is  404.

We fix this.
    
URL: sagemath#36611
Reported by: Dima Pasechnik
Reviewer(s): John H. Palmieri

Author: Release Manager

src/sage/rings/polynomial/msolve.py

@@ -8,7 +8,7 @@
 This module provide implementations of some operations on polynomial ideals
 based on msolve.
 
-Note that the `optional package msolve <../spkg/msolve.html>`_ must be installed.
+Note that the `optional package msolve <../../../../spkg/msolve.html>`_ must be installed.
 
 .. SEEALSO::
 

src/sage/rings/polynomial/multi_polynomial_ideal.py

@@ -2585,7 +2585,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True
              {y: 0.3611030805286474?, x: 2.769292354238632?},
              {y: 1, x: 1}]
 
-        We can also use the `optional package msolve <../spkg/msolve.html>`_
+        We can also use the `optional package msolve <../../../../spkg/msolve.html>`_
         to compute the variety.
         See :mod:`~sage.rings.polynomial.msolve` for more information. ::
 
@@ -2667,7 +2667,7 @@ def variety(self, ring=None, *, algorithm="triangular_decomposition", proof=True
           on a toy implementation otherwise.
 
         - With ``algorithm`` = ``"msolve"``, uses the
-          `optional package msolve <../spkg/msolve.html>`_.
+          `optional package msolve <../../../../spkg/msolve.html>`_.
           Note that msolve uses heuristics and therefore
           requires setting the ``proof`` flag to ``False``. See
           :mod:`~sage.rings.polynomial.msolve` for more information.
@@ -4275,7 +4275,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal
             Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available)
 
         ``'msolve'``
-            `optional package msolve <../spkg/msolve.html>`_ (degrevlex order)
+            `optional package msolve <../../../../spkg/msolve.html>`_ (degrevlex order)
 
         ``'magma:GroebnerBasis'``
             Magma's ``Groebnerbasis`` command (if available)
@@ -4403,7 +4403,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal
              b*c - 19*c^2 + 10*b + 40*c, a + 2*b + 2*c - 1]
 
         Over prime fields of small characteristic, we can also use the
-        `optional package msolve <../spkg/msolve.html>`_::
+        `optional package msolve <../../../../spkg/msolve.html>`_::
 
             sage: R.<a,b,c> = PolynomialRing(GF(101), 3)
             sage: I = sage.rings.ideal.Katsura(R,3)  # regenerate to prevent caching