Just draw a flow chart of how the code should run. Not the actual code

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural mumber greater than 1 that is not a prime number is called a composite number Create a C++ program that utilizes nested for loop that asks the user for a mumber then the program should compile a list of all natural numbers from 2 to the number the user keyed in marking with a star the prime numbers only. 1. Asks the user for number 2. List all numbers from 2 to the user typed number 3. Mark the Prime number with a stars leaving the composite numbers not labeled 4. Stars should increment keeping track of the prime numbers found previously 5. In case no Prime numbers is found your program should notify the user 6, Make sure to check your program for values over 1801