For the method below, which call recurses forever (never reaches the base case)?
static void count(int n) { if (n == 0) return; System.out.println(n); count(n - 1); }