ns = A[:i] + A[i+1:]
    projection_vector = cross_of(other_planes_ns)
    p = project_by_vector(p, projection_vector, plane_n, plane_d)
  return p
    </pre>
    </div>

    <form>
        <b>Quest 9.</b> Please estimate the complexity of the algorithm above in big-O.<br>
        <div id="complexity_buttons" style="font-family:sans-serif; font-style:italic;"><i>
        <input type="radio" name="q8" id="aq8_1" value="A">O(n<sup>2</sup>)<br>
        <input type="radio" name="q8" id="aq8_2" value="B">O(n<sup