Java

Without using a division or multiplication operator and without using iteration, define a recursive method named product that accepts two int parameter, m and k, and calculates and returns the integer product of m times k . You can count on m>=0 and k>=0.