What is recursion in Python?

What is a base case in recursion?

What happens if a recursive function has no base case?

What is the output of `def fact(n): return 1 if n==0 else n*fact(n-1); print(fact(3))`?

What does `def count(n): if n<=0: return; print(n); count(n-1); count(3)` print?

What is the maximum recursion depth in Python (default)?

Which of the following problems is commonly solved with recursion?

How does recursion compare to iteration in terms of memory?

What is tail recursion?

What is the output of `def f(n): if n==0: return 0; return n + f(n-1); print(f(3))`?