Please help answer this question.

I already finished problem 2.10, I am just including it to because question mentioned part a of question 2.10

Please just answer question 2.11....Thank you very much!!!!

2.10aConstruct a Playfair matrix with the key largest b. Construct a Playfair matrix with the key occurrence. Make a reasonable assump- tion about how to treat redundant letters in the key 2.11 a Using this Playfair matrix: Encrypt this message: Must see you over Cadogan West. Coming at once. Note: The message is from the Sherlock Holmes story, The Adventure of the Bruce Partington Plans. b. Repeat part (a) using the Playfair matrix from Problem 2.10a. e How do you account for the results of this problem? Can you generalize your conclusion