How do I do this?

2) Several students suggested that it might be possible to do the sieve of Eratosthenes by representing boolean values in Java (or, for that matter, C) as bits rather than one-byte Boolean values. Sketch the pseudocode of an algorithm that would allow you to do this, taking account of how you would handle the bitwise ordering of the bit values. Be sure to include a mention of the type of variable/base type you would use to store the bit values, whether your machine is Big- or little-endian, and how the -endian nature of your machine would affect the running of the sieve