Consider the following code:

// Write the digits of the number, stacked vertically.
// If number is negative, then a negative sign appears on top.
void superWriteVertical(int number) {
  if (number < 0) {
    System.out.println("-");
    superWriteVertical(-number);
  }
  else if (number < 10)
    System.out.println(number);
  else {
    superWriteVertical(number / 10);
    System.out.println(number % 10);
  }
}

Which call will result in the most recursive calls?

• superWriteVertical(-103);
• superWriteVertical(1023);
• superWriteVertical(0);
• superWriteVertical(100);