Compute the mod values of the following using the mod computation relation.

a$.5$mod$3$

b$.5$mod$-3$

c$.-5$mod$3$

d$.-5$mod$-3$

Use Euclid Algorithm $($iterative way$)$ to compute the gcd of

a$)24140$ and $16762.$ Must show your work.

b$)4655$ and $12075$

Using the extended Euclid Algorithm, find the multiplicative inverse of $1234$ and $4321$

Show the computation in details

Write a C$++$ program to implement the Extended Euclid Algorithm. Test the hand computed

result using the code.

Explain RSA algorithm by using the following data:

$p=17,q=11$

Select $e=7,$ compute $d$

Use numerical value of the message $M=88$

Compute the encrypted message value.