Can someone give me a correct answer?

Consider a cipher which encrypts messages in M={A,B,C}. The probabilities of sending each message are Pr[m=A]=1/3,Pr[m=B]=1/2,Pr[m=C]=1/6. The secret key is generated randomly from K={k1,k2,k3} according to the probability distribution shown in the figure below. The encryption mapping is shown in the figure below (e.g., f(A,k1)=z ): a) (2 marks) What is the ciphertext space C ? b) (3 marks) Compute all the conditional probabilities on the ciphertext (i.e., Pr[c=qm=A],Pr[c=rm=A]),Pr[c=zm=A]),Pr[c=qm=B]),). c) (5 marks) Is this cipher perfectly secret? Why or why not? If not, how can it be modified to achieve perfect secrecy