You are going about your day with your brother Kyle when a shiny demon appears out of nowhere.

The demon asks you, "Be you angels?! If so, print me a list of all prime numbers from a range I will give you. Then end number will be bigger than the start number. The range is inclusive with both the start and end points. Prime numbers are only divisible by 1 and itself. Prime numbers are always 2 or greater. "

You wonder why you got into this predicament. Perhaps it's payback for when you didn't do your prime number homework.

You stand tall, and reply to the demon, "No, we are but programmers, rock!".

You realize you can write a program to do this task for you.

Write a function that finds all prime numbers in a range. Start and end points are inclusive. The end point is always greater than the start point.

input: {startNum: 0, endNum: 10}, output: [2,3,5,7]

input: {startNum: 0, endNum: 100}, output: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

input: {startNum: 10, endNum: 100}, output: [11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]