Not really understanding the code from Chapter 7, the program lists all prime numbers from 1-100.

I don't understand how it works, if someone could briefly describe what each function does, that would help considerably.Code:#include <iostream> bool isDivisible (int number, int divisor); bool isPrime (int number); using namespace std; int main () { for ( int i = 0; i < 100; i++ ) { if ( isPrime( i ) ) { cout << i << endl; } } } bool isPrime (int number) { for ( int i = 2; i < number; i++) { if ( isDivisible( number, i ) ) { return false; } } return true; } bool isDivisible (int number, int divisor) { return number % divisor == 0; }

Thanks in advance,

-lamb