here gives how to calculate it.
The number of primitive roots modulo n is phi(phi(n)).And then isn't primitive root just phi(phi(n)).
I *believe* a.) is 100, although not sure how to show it, and then therefore b.) will be 40, although showing it is the issue. Probably the hardest part is c.)