Implement a Fermat factorization attack

you should first implement a basic algorithm which can factor small n

such as n$=11413,57677,642401,2288233,2776099,3837523,27046456501($taken from the homework problems in chapter $9)$

Implement a $($p$-1)$ factorization attack

feel free to create a different Bad$\_$RSA$\_$key$()$ class which is succeptible to the $($p$-1)$ attack.

it may also be possible to modify the example code above to use the same Bad$\_$RSA$\_$key with different checks

Demonstrate via one of the two attacks above that you can factor a key with $64-$bit primes p and q$.$

In PYTHON please.