Write a program to find the 10001st prime number, where the 1st prime is 2, 2nd is 3, 3rd is 5, and 4th is 7
Implement find_nth_prime(n) and return the nth prime using one-based indexing. For the required case, call the function with n = 10001.
def find_nth_prime(n):