For each of the following primes $p$ and ainN, compute $a^{-1}(modp)$ by using the Fermat's Little

Theorem and the Fast Powering Algorithm:

$($a$)p=587$ and $a=345.$

$($b$)p=104801$ and $a=78467.$