Python please, will thumbs up! Below is the is_prime_fast function

1. To check whether a number n is prime, you can first check whether n is even, and then check whether n has any odd factors. Change the is_prime_fast function by implementing this improvement. How much of a speedup did you get? 2. Use the \%timeit tool to study the speed of is_prime_fast for various sizes of n. Using about 10 data points, relate the size of n to the time taken by the is_prime_fast function. 3. Write a function is square (n) to test whether a given integer n is a perfect square (like 0,1,4,9,16, etc.). How fast can you make it run? Describe the different approaches you try and which are fastest