$2.$ What is the difference between a computational assumption and a computational fact.

$3.$ Give an example of a computational assumption $($different from P ne NP $)$

$4.$ What computational assumption is used in the proof of perfect secrecy$?$

$5.$ Discuss the consequence of altering the deterministic

assignment of m:$=$ De$*$c$\_\{$k$\}($c$)$ in slide $5$ of module $1\mathrm{.}1$ to

be randomized as in m leftarrow De$*$c$\_\{$k$\}($c$).$