We need a pristine table or diagram. Please deliver a perfect solution quickly. AO$11$ "Suppose that RSA encryption uses a modulus n of $1500$ bits.

$1.$ Assuming that the square$-$and$-$multiply method is used for exponentiation,

compare the computational cost of encryption, measured in the number of squarings and the number of multiplications, in the following cases:

$($a$)$ e $=3$

$($b$)$ e $=2^16+1$

$($c$)$ e is chosen randomly between $0$ and n$.$

$2.$ How much computation is required for decryption in each case?

Hint: d is always calculated with regards to e$,$ meaning that we do not choose a specific value for d$.$ Therefore, whatever e is$,$ d can be any value between $0$ and $($n$)."$