hi, i'm stuck on this assignment question. my teacher said it's really easy so i think i'm just missing something obvious? thanks (Headbang)

Let p be an odd prime and g be a primitive root modulo p. Let y be an integer such

that gcd(y, p-1) = 1. Show that g^y is a primitive root modulo p.