Encryption using Random Functions. Let F be the set of all functions 10, 1)"- 0,1]". Consider the following private-key encryption scheme. . Gen): Return skF uniformly at random from the set F . Encsk(m): Return (c, r), where r is chosen uniformly at random from 10,11" nd) (7.), and S . Decsk(C, T): Return c)F(r). (a) (12 points) Suppose we want to ensure that even if we make 10calls to the encryption algorithm, all randomness r that are chosen are distinct with proba- bility 1 2-100. What value of n shall you choose? Encryption using Random Functions. Let F be the set of all functions 10, 1)"- 0,1]". Consider the following private-key encryption scheme. . Gen): Return skF uniformly at random from the set F . Encsk(m): Return (c, r), where r is chosen uniformly at random from 10,11" nd) (7.), and S . Decsk(C, T): Return c)F(r). (a) (12 points) Suppose we want to ensure that even if we make 10calls to the encryption algorithm, all randomness r that are chosen are distinct with proba- bility 1 2-100. What value of n shall you choose