computer science

sub: cryptography

i have $3$ questions

Q$1$: Write a complete RSA example $($use your own values$)$ and explain all the steps.

Q$2$: For RSA, Suppose that p$=11,$ d$=7$ and e$=7$ Calculate n$,$ totient n and d$.$ After finding d$,$ prove

that it is a possible solution?

Q$3$: If P$=9$ and G$=5,$ Calculate the symmetric key using Diffie$-$Hellman algorithm? Calculate each

step