Write a Haskell script for the following without using any built in functions. You must write functions from scratch in order to use them.

Write a function divisors:: Integer -> [Integer] which calculates the list (in ascending order) of all prime divisors of a positive integer (re- turning the empty list if the number is less than or equal to one)