Write an algorithm in pseudo code that finds all prime numbers between 2 and 100. You may use any algorithm to compute them, but be sure that your pseudo code meets the three requirements of an algorithm: definiteness, effectively computable, and finiteness.