DATA STRUCTURES IN PYTHON: Write a short Python function that takes a positive integer n and returns the sum of all the squares of all the positive integers.

1. Given a list of numbers in random order, write an algorithm that works in O(nlog(n)) to find the kth smallest number in the list.

2. In many ways it would be better if all fractions were maintained in lowest terms right from the start. Modify the constructor for the Fraction class so that GCD is used to reduce fractions immediately. Notice that this means the __add__ function no longer needs to reduce. Make the necessary modifications.

3. Implement the remaining simple arithmetic operators (__sub__, __mul__, and __truediv__).

4. Write a short Python function that takes a positive integer n and returns the sum of all the squares of all the positive integers.