Instructions: Write a Java program that finds a multiplication table for varying n with values between 1 and 10. The value k for a specific run should be solicited from the user. Implement both the iterative and recursive approaches. Perform a test on the two algorithms using low bound - k =1, median - k = 5 and upper bound k = 10 and report on your performance findings on these two algorithms (iterative and recursive).