Design and write a modular python program for the below.

A positive integer greater than $1$ is said to be prime if it has no divisors other than $1$ and itself. A positive integer greater than $1$ is composite if it is not prime. Write a program that asks the user to enter an integer greater than $1,($number input cannot be less than $25)$ then displays all of the prime numbers that are less than or equal to the number entered. The program should work as follows:

Once the user has entered a number, the program should populate a "two dimensional" list with all of the integers from $2$ up through the value entered.

The program should then use a loop to step through the list. The loop should pass each element to a function that displays whether the element is a prime number, or a composite number.