Let $\backslash$Pi $=($Gen$,$ Enc, Dec$)$ be the CTR mode encryption scheme and $\backslash$Pi $=($Gen$,$Enc$,$Dec$)$ be the encryption scheme obtained from $\backslash$Pi by using a truly random function f instead of a pseudorandom function Fk $($This is to say that $$Gen picks uniformly f in F uncn, while Gen picks uniformly k in $\{0,1\}$n$,$ and $$Enc uses f where Enc uses Fk$.$ Show that there is a negligible function negl, such that for any PPT adversary A$,$ it holds thatLet $\backslash$Pi $=($Gen$,$ Enc, Dec$)$ be the CTR mode encryption scheme and $\backslash$Pi $=($Gen$,$Enc$,$Dec$)$ be the encryption scheme