Which of these methods which are used for time advance discretization in DNS needs more computation per time step?

• A. Adams-Bashforth
• B. Runge-Kutta method
• C. Leapfrog
• D. Newton Raphson method