[Python 3 language] please test that it works In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself) i.e. ?₁(n) = 2n.

Write a function, perfect bazinga), that takes in a integer num and returns a function that takes in a number top of _range which will return a list of all integers from O, top_of_range) (including 0 but excluding top_of_range) but overrides the numbers with curious descriptives as follows return Bazinga instead for all the numbers that are divisible by num return I'm Perfect if a number is perfect o Perfect Number return I'm Both if a number is both perfect and divisible by num