Correct option is D
To find the last two digits required we have to calculate 32019≡p mod100.
From Euler's theorem: if a(prime) and 100 are co prime then the satisfy:
aϕ(n)≡1mod n , where ϕ(n) is Euler's phi function
Using this, we get.
3ϕ(100)=1mod100ϕ(100)=40⟹340≡1mod100⟹(340)50≡150mod100⟹32000≡1mod100⟹32019≡1.319mod100⟹32019≡1319mod100Now compute :319mod10034=81,38=6561≡61mod100⟹316≡612mod100⟹316≡3721mod100⟹316≡21mod100⟹316.33≡21.33mod100⟹319≡567mod100⟹319≡67mod100Hence, last two digits will be 67⟹Option D is correct.