Write a method that returns the sum of all of the prime factors of the integer input parameter n (n>=2). If n is a prime number, return n. For example, primeSum(12) returns 7 because the prime factors of 12 are 2, 2, 3 and 2+2+3=7. This method only needs one loop and no recursion, or you can try to solve it recursively with no loops.