Please code using C, and use arrays; Include a flowchart

The prime numbers from 1 to 100 can be found using the following formula. Cross off all multiples of 2, but not 2 itself, from a list of numbers ranging from 1 to 100. Then locate the next non-crossed number, n, and cross off all multiples of n. yet not n in and of itself Repeat this last step as long as n does not exceed ten (because ten equals one hundred). Except for 1, the remaining numbers in the list are prime. Write a program to print all the prime numbers from 1 to 100 using this strategy. Instead of one prime per row, display 10 to 20 digits per row, depending on the size of your screen. Run the program from 1 to 100, then from 1 to 625. Wikipedia has a stunning animation on its page.