Please write the following function in HASKELL. Use the specifications below - please comment so I can understand your procedure.

Functions primeFactors primeFactors :: Int -> Int] Given a positive integer n, return a list of its prime factors, in increasing order. Include the correct number of occurrences, e.g prime tactors(24) is 12 ,2,2,31 *Homework3> primeFactors 5 15] Homework3> primeFactors 50 [2,5,5] *Homework3> primeFactors 66 [2,3,11 Homework3> primeFactors 463 14631 Homework3> primeFactors 512 [2,2,2,2,2,2,2,2,21