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

$2.$ Give an example of a computational assumption $($different from P $!=$ NP$).$

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

$4.$ Discuss the consequence of altering the deterministic assignment of m :$=$ Deck$($c$)$ in slide $5$ of module $1\mathrm{.}1$ to be randomized as in m $$ Deck$($c$).$