The concept of multiplication can be defined recursively as follows: [1 mark]

If m and n are two positive integers, m * n = m, if n = 1; or m * n = n, if m = 1; or m*n = m + m*(n-1)

Select from the following methods the one that best describes the above algorithm.

Select one:

a. static int multiply(int m, int n) { if (m == 1) return n; else if (n == 1) return m; else return multiply(m, n - 1); }

b. static int multiply(int m, int n) { if (m == 1) return n; else if (n == 1) return m; else return m + multiply(m, n - 1); }

c. static int multiply(int m, int n) { if (m == 1) return n; else if (n == 1) return m; else return m + (m, n - 1); }

d. static int multiply(int m, int n) { if (m == 1) return n; else if (n == 1) return m; else return m + m * (n-1); }