Write two Java programs (or alternatively one Java programme that includes the two alternative implementations) which can calculate the solution to the following series to the value n where n is entered by the user via console. A. Code without using recursion OR a function B. Code using recursion. C. Discuss briefly the efficiency of your algorithm. 1 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 1936 84 126 126 84 36 9 1 10 45 120 200 252 200 120 45 10 1