<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def inedpl(a, b, c, plane):
 """ Find the intersection of a triaxial ellipsoid and a plane. http://naif.jpl.nasa.gov/pub/naif/toolkit_docs/C/cspice/inedpl_c.html :param a: Length of ellipsoid semi-axis lying on the x-axis. :type a: float :param b: Length of ellipsoid semi-axis lying on the y-axis. :type b: float :param c: Length of ellipsoid semi-axis lying on the z-axis. :type c: float :param plane: Plane that intersects ellipsoid. :type plane: spiceypy.utils.support_types.Plane :return: Intersection ellipse. :rtype: spiceypy.utils.support_types.Ellipse """

    assert (isinstance(plane, stypes.Plane))
    ellipse = stypes.Ellipse()
    a = ctypes.c_double(a)
    b = ctypes.c_double(b)
    c = ctypes.c_double(c)
    found = ctypes.c_int()
    libspice.inedpl_c(a, b, c, ctypes.byref(plane), ctypes.byref(ellipse),
                      ctypes.byref(found))
    return ellipse, bool(found.value)