1 ALOTTERY PROBLEM Write the method named lottery. You have a lottery ticket, with ints a, b, and con it. This makes three pairs, which we'll call ab, bc, and ac. Consider the sum of the numbers in each pair. If any pair sums to exactly 10, the result is 10. Otherwise if the ab sum is exactly 10 more than either bc or ac sums, the result is 5. Otherwise the result is 0. Return the sum. Here are some samples . input of 9, 1, 0 10 . input of 9, 2, 00 input of 6, 1, 4 10 2 THE LIMITING PROBLEM Write the method named limitSum. Given 2 non-negative ints, a and b, return their sum, so long as the sum has the same number of digits as a. If the sum has more digits than a, just return a without b. . input of 2, 3 5 input of 8, 38