Problem A Show that, for any symmetric encryption scheme, ind$-security (indistinguishabilit from random bits) implies rr-security (real-or-random security, as we have defined it), formulating and proving your result.