- Count how many even and how many odd numbers you have in the array
- For each number count the amount of times it appears in the array
- Find out how many primes the array has
- For each number decompose the number into primes
- For each prime count how often it appears
const numbers = [ 18,68,12,13,9,11,62,47,73,45,40,67,89,27,75,29,20,48,23,25,46,21,59,93,84,55,57,1,35,56,61,17,42,5,97,86,60, 39,94,14,95,58,91,33,53,77,85,19,65,4,16,100,36,6,79,8,3,43,87,66,52,34,98,72,24,81,49,51,90,92,54,10,78,76, 15,63,31,69,41,38,26,96,82,2,32,70,22,71,37,88,44,83,74,64,30,80,99,28,7,50 ]