Use python and Explain your code, Thank you so much.

[25 pts] Write a function digSum(n), which takes a positive int, n, and returns the digit sum of n. For example, the digit sum of 125 is 1 + 2 + 5 = 8. Hint: If n is changed to a string, you can traverse the string one character at a time with a for loop. As the string is traversed, change the data type to an int and update a sum accumulator. 2. (25 pts] Use the function from Q1 and print out all the prime numbers from 2000 to 2500, inclusive. that have a digit sum of 10 or 14. Use any other helper functions that are useful. For full points, use list comprehension. If needed, look up how to do list comprehension with an if statement. 3. [5 pts] Use the function from Q1 and print out all the prime numbers from 2000 to 2500, inclusive, that have a prime digit sum that is larger than 15. For full points, use list comprehension