(a) let us prove fermat's little theorem. let p be a prime number. prove by induction on n that for all n e nu {0}, it holds that np = n (mod p). mark, where you need that p is a prime. (hint: use #5,#6 from page 12 and show that when 0