Write a python function by using recursion

is_square_free(n) returns True is n is square and False otherwise

Using recursion

loop, for, while are not allowed in this problem

Hint: A number is said to be square free if no prime factor divides it more than once, i.e., largest power of a prime factor that divides n is one.