Prepare a C program which implements the Sieve of Erastosthenes and determines the primes among the first N integers that you enter through a prompt or the command line.

Write down the integers to a file, ten primes per line, tab delimited. Prepare a class diagram for the dining philosopher problem. There exist five philosophers and 5 forks around the circular table. Each philosopher has access to the 2 forks, one on either side. Each fork is shared by two philosophers. Each fork may be either on table or in use by one philosopher. A philosopher should have 2 forks to eat.