$11.$ Suppose a public$-$key cryptosystem encrypts integers $($say$,$ modulo another integer n$).$ Show that if this scheme has the property that Dec$($Enc$($x$)$ Enc$($y$))=$ x $+$ y for any messages x$,$ y$,$ then the scheme is necessarily vulnerable to a CCA$2$ attack.