Consider the following encryption scheme S $=($Gen$,$ Enc, Dec$)$ where F is a pseudorandom permutation $($PRP$).$ Recall that a PRP is a bijective PRF and a PRP is invertible

$$ Gen$(1$n

$)$ choose a uniform string $\backslash$kappa in $\{0,1\}$

n

for F and output it

$$ Enc $(\backslash$kappa $,$ msg$)$: On input $\backslash$kappa in $\{0,1\}$

n and a message msg in $\{0,1\}$

n

$,$ select a random string

r in $\{0,1\}$

n output the ciphertext

ct :$=<$ r$,$ F$\backslash$kappa $($msg$)$ r $>$

$$ Dec$(\backslash$kappa $,$ ct$)$: on input ciphertext c $=<$ r$,$ s $>,$ output

msg :$=$ F

$1$

$\backslash$kappa

$($s $$ r$)$

$($a$)(5$ pt$.)$ Is this a CPA secure encryption scheme? Explain your answer