/*
 * Task 03:
 * 
 * complete the following method to meet the 
 * indicated specification
 */

package task03;

public class Recursion {
	
	// use recursion to compute the product of 
	// the integers from n to m, which means
	// n * (n+1) * ... * m
	// Assume that n < m and ignore integer overflow
	
	// You are allowed to add a private helper method

	public static int multiply(int n, int m) {
		// COMPLETE THIS METHOD

	}

}