Update 002-Recursion.md

Author: ajay-dhangar

dsa/beginner/002-Recursion.md

@@ -1,5 +1,5 @@
 ---
-id: recursion
+id: 0002-recursion
 title: Recursion
 sidebar_label: Recursion
 tags:
@@ -13,8 +13,6 @@ tags:
 description: "This page explains the concept of Recursion with detailed explanations, examples, and code implementations."
 ---
 
-# Recursion
-
 ## 1. What is Recursion?
 
 Recursion is a programming technique where a function calls itself in order to solve a problem. This technique divides the problem into smaller, more manageable sub-problems. A recursive function has two main parts:
@@ -100,7 +98,7 @@ Compute the factorial of a given number using recursion.
 
 ## 5. Constraints
 
-- $0 <= n <= 12$ (for reasonable output)
+- $0 \leq n \leq 12$ (for reasonable output)
 
 ## 6. Algorithm for Recursion
 
@@ -201,4 +199,4 @@ Compute the factorial of a given number using recursion.
 ## 11. References
 
 - [GeeksforGeeks - Recursion](https://www.geeksforgeeks.org/recursion/)
-- [Wikipedia - Recursion](https://en.wikipedia.org/wiki/Recursion_(computer_science))
+- [Wikipedia - Recursion](https://en.wikipedia.org/wiki/Recursion_(computer_science))