NOTE Code should be in Python.

Write a function PI(num) that takes a positive integer as input and returns a list of that number's prime divisors.

Add a function LOL(listOfLists), that takes as input a list of zero or more sublists each containing zero or more numbers, and determines and prints

the maximum number among all of the sublists and the sublist containing that maximum.

the sublist list whose elements sum to the greatest total

If there is a tie for maximum, you may print any one of the sublists that contains that maximum. If there is no maximum, LOL should print an appropriate message. If there is a tie for greatest sublist sum, you may print any one of the sublists having that sum. The sum of items in an empty list should be treated as 0.