1. Write a recursive method that computes the number of digits in an integer n . (You might recall from page 21 that this is  for positive numbers.) Do not use any local variables in your method...

1. Write a recursive method that computes the number of digits in an integer
n. (You might recall from page 21 that this is
 for positive numbers.) Do not use any local variables in your method declaration. Find a variant expression and threshold to show that your method has no infinite recursion.