please solve using PYTHON AND NO STRINGS. NO LISTS while loops, for loops, are allowed.

A Kaprekar number is a non-negative integer, the representation of whose square can be split into two possibly-different-length parts (where the right part is not zero) that add up to the original number again. For instance, 45 is a Kaprekar number, because 45**2 = 2025 and 20+25 = 45. You can read more about Kaprekar numbers here. The first several Kaprekar numbers are: 1, 9, 45, 55, 99, 297, 703, 999 , 2223, 2728 With this in mind,

• Write the function isKaprekarNumber(n) that takes a non-negative integer n and returns True if n is a Kaprekar number and False otherwise.

• Write the function nthKaprekarNumber(n) that takes a non-negative int n and returns the nth Kaprekar number, where as usual we start counting at n==0 - so 0th Kaprekar number is 1, 1st Kaprekar number is 9 and so on.