Create a function named divisors that takes an integer and returns an array with all of the integer's divisors(except for 1 and the number itself). Example: divisors (12); //should return [2,3,4,6] divisors (25); //should return [5] divisors (13); //should return [] You can assume that you will only get positive integers as inputs.