diff --git a/bonus_lab_funcation_102.py b/bonus_lab_funcation_102.py
new file mode 100644
index 0000000..aa3b90b
--- /dev/null
+++ b/bonus_lab_funcation_102.py
@@ -0,0 +1,29 @@
+def camel_to_sentence(text: str) -> str:
+    """
+    Convert a CamelCase string into a sentence with spaces and lowercase letters.
+
+    Args:
+        text (str): Input string in CamelCase format.
+
+    Returns:
+        str: Modified string with spaces before capital letters and all letters in lowercase.
+    """
+
+    result = "" 
+
+    for char in text:
+
+# Convert uppercase letters to lowercase and insert a space before them
+        if char.isupper(): 
+            result += " " + char.lower()
+
+# Keep small letters, numbers, and symbols unchanged
+        else:   
+            result += char
+            
+    return result # Store the full sentence after formatting
+
+user_input = input("Enter a sentence where each word starts with a capital letter (e.g., HelloWorld): ")
+formatted_text = camel_to_sentence(user_input)
+print("\nFormatted string:")
+print(formatted_text)
\ No newline at end of file
diff --git a/prime numbers_lab.py b/prime numbers_lab.py
new file mode 100644
index 0000000..96c4b47
--- /dev/null
+++ b/prime numbers_lab.py	
@@ -0,0 +1,45 @@
+def find_prime_numbers(start_number: int, end_number: int) -> list:
+    """
+    Return a list of prime numbers between two numbers .
+
+    Args:
+        start_number (int): The first number in the search range.
+        end_number (int): The last number in the search range.
+
+    Returns:
+        list[int]: A list of prime numbers between the given range.
+    """
+
+    prime_numbers_list = []
+
+    for current_number in range(start_number, end_number + 1):
+
+        if current_number < 2:
+            continue
+
+        is_prime = True
+
+        for divisor in range(2, current_number):
+            if current_number % divisor == 0:
+                is_prime = False
+                break
+
+        if is_prime:
+            prime_numbers_list.append(current_number)
+
+    return prime_numbers_list
+
+
+# User Input 
+print("Enter the range to search for prime numbers between them.")
+
+first_number = int(input("Enter the first number: "))
+second_number = int(input("Enter the second number: "))
+
+print("\nPrime numbers in this range:")
+
+result = find_prime_numbers(first_number, second_number)
+
+# Print each element in the list line by line
+for number in result:
+    print(number)