$($Ans by no $1,2,3)$ thank you

$$

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

Give an example of a computational assumption $($different from $PNP).$

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

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 $mlarrDe{c}_k(c).$