Number theory problem involving GCD

[Guest]

Hello I am having trouble solving this question.
Could You please provide insight? The question is:
The function delta(n) determines the number of positive integers less than n and that are prime with n, meaning that, integers k so that the GCD(greatest common divisor) (n,k)=1. calculate:

1) delta(12)
2) delta(p), p being prime