Given the following recursive algorithm: example (int n) if (n > 0) then example(n / 2); example(n / 2); end if; Output ("#"); end; How many hashes (#) are printed by the method call example(5)? (Note: Integer division is used throughout this method.)