//USE JAVA
Given a non-negative int n, compute recursively (no loops) thecount of the occurrences of 3 as a digit, except that a 3 withanother 3 immediately to its right counts double, so 3363 yields 4.countThe3s(3) → 1
countThe3s(24680) → 0
countThe3s(313) → 2
countThe3s(3363) → 4
Expert Answer
Answer to //USE JAVA Given a non-negative int n, compute recursively (no loops) the count of the occurrences of 3 as a digit, exce…