Design using pseudocode and implement a solution to the problem in Python.

Create a test and show a trace of your design. Create a module called is_prime that accepts a single integer. You may assume that all integers that will be entered will be greater than 1. The is_prime module should return true if the number entered is 1 or if the number can only be divided without a remainder by itself and 1.

Create a main routine that will ask the user to enter a positive integer greater than 500. You may assume the user enters a valid integer. Print out all of the prime numbers that are between 1 and the user's input inclusive.

Results may not rely on a literal variable containing prime numbers, in any format, and the prime numbers all be calculated by some method.