I need help implementing this application in Java Programming! I'll provide as many information as I can.

If k, and m are integers with values in between 1 to 10, write a program that counts all the combinations with the same sum (e.g. given sum = 10 - prompt the user to enter the desired sum) of all the possible six-number arrangement in a row where k m and k

Table 1 coico colo Counter 1 1 2 1 3 3 1 4. 1 5 1 6 1 7 1 8 1 9 1 10 2 11 2 2 12 2 13 2 14 2 15 2 16 2 17 2 2 Numbers Counter Numbers Counter Numbers 2 18 3 4 4 36 6 7 7 3 19 3 5 37 6 8 4 20 3 6 38 69 5 21 3 7 39 6 10 6 22 3 8 40 7 8 7 23 3 9 41 7 9 8 24 3 10 42 7 10 9 25 4 5 43 8 9 10 26 4 6 44 8 10 3 27 4 7 45 9 10 4 28 4 8 5 5 29 4 9 6 30 4 10 7 7 31 5 6 8 32 5 7 9 33 5 8 10 34 5 9 35 5 10 Doo |uuuu nx(n-1) 10 x 9 Combinations = = 45 2 2 N Table 2 3 4 5 CONCO Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Sum is Possible Combinations 1 1 2 2 3 3 4 4 5 4 7 8 9 10 11 12 13 14 15 16 17 18 19 This table gives you the number of possible combinations for every possible sum. You must explain why 11 has the maximum number of combinations and why, e.g. sum 7 and sum 14 have the same number of combinations (3). 3 3 2 2 1 1 45 O UNA This table highlights the 4 number combinations that result to a sum equal to 10. 5 loroc colos 24 10 Table 3 Counter Numbers Counter Numbers 1 1 2 18 3 4 21 3 19 3 5 31 4 20 3 6 4 1 5 21 5 1 6 22 8 6 1 7 23 9 1 8 3 8 25 5 9 1 10 26 4 6 10 3 27 4 7 11 4 28 4 8 12 5 29 4 9 132 6 30 4 10 142 31 5 6 15 2. 8 32 5 7 16 2 9 33 5 17 2 10 34 5 35 5 + AWNO NNNNN O 000000000 Table 4 Sum Sum Counter Counter Numbers Counter Counter Numbers 1 1 18 3 4 2 1 19 3 5 3 1 20 3 6 4 1 21 3 7 5 1 22 3 8 6 1 23 3 9 7 1 24 3 10 8 1 25 4 5 9 1 10 26 4 4 6 10 2 27 4 7 11 2 28 4 8 12 2 29 4 9 13 2 30 4 10 14 2 7 31 5 6 15 2 8 32 5 7 16 33 5 8 17 10 34 5 9 35 5 10 Co AWOCOWN Awwww This table shows that on your programming you must add another counter (sum counter) that indicates which number combinations have a a sum equal to the one the user enters. E.g. the 15th total combination (out of 45) provides the 2nd combination that has a sum equal to 10. 1 2345B un nu NN