Problem 1 (Divisors and Prime Numbers) a) Write a program named t4_p1.py that uses a while loop to print all divisors of an integer number entered by the user. Note: The definition of a divisor is a...

Can someone solve this question?

Extracted text: Problem 1 (Divisors and Prime Numbers) a) Write a program named t4_p1.py that uses a while loop to print all divisors of an integer number entered by the user. Note: The definition of a divisor is a number that divides another evenly (i.e., without a remainder). For example, the number 2 has two divisors – 1 and 2. The number 6 has four divisors – 1, 2, 3 and 6. The number 12 has six divisors – 1, 2, 3, 4, 6 and 12. b) Update your program so that it also prints the sum of all the divisors of that input. See the sample output below. c) Now update your program so that it prints whether the number the user entered is a prime number or not. Note: the definition of a prime number is that number has only two divisors – 1 and itself. See the sample output below. d) Implement the same program as above using a for loop instead of a while loop. Which implementation do you think is the better choice for this problem? Discuss with a friend and/or a TA if you are unsure. Sample Outputs (user input is highlighted) Enter an integer: 20 The divisors are: 1 2 4 10 20 The sum of the divisors is 42 The number is not a prime Enter an integer: 73 The divisors are: 1 73 The sum of the divisors is 74 The number is a prime