Write a Java program that determines, given a number n, the nth Fibonacci number. Provide two solutions, one that implements a recursive algorithm and another that implements a dynamic programming solution. For your test cases set n = 10, n= 50 and n = 70 and monitor the performance. Report on your findings noting how your results compare to the known big O for each of the algorithms.