this is a python work. NOTE: You may not use any functions from external modules loaded by 'import.' In addition, you may not use dictionaries, list comprehensions,

thanks for helping!

2. Write function q2(num) that takes a positive integer as input and returns a list of that number's prime divisors. You may copy and use the numlsPrime function developed in class if you wish Note: First, implement a correct algorithm for this problem, testing it on not-very-large numbers. Next, test it on 5003 *5003+1 or similarly large numbers. If it takes a long long time on such numbers, consider whether you can re-organize your algorithm to make it faster. For this assignment, we won't deduct for inefficiency, but it's a good thing to think about Examples: 2(36) 2,31 q2(23) 123, 9212 q2(5003 5003+1) 2, 5, 2503001 121 11 9211 2(4)