Instructions: Write a Java program that outputs 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 a low bound of k =1, median k = 5, and upper bound k = 10, 20, 50, and 100. and report on your performance (milliseconds) findings on these two algorithms (iterative and recursive).

Screenshot of the output for when k =1, 5, 10

Performance table showing the milliseconds taken for iterative & recursive methods when k is 1, 5, 10, 20, 50, and 100. If your recursive call for k =100 doesn't succeed, then indicate an error on the report.