Write a method that accepts two numbers, 'num' and 'ofst'. Return the product of all the digits in 'num' but with each digit offset by 'ofst' amount. For example, if you pass in 523,-1 the result would be 8 because 4*1*2=8. So each digit is offset by -1 making the 5 a 4, the 2 a 1, and the 3 a 2, then the product of all those values is found. This CAN be done nicely with recursion, but recursion is NOT required.