Interested in a PLAGIARISM-FREE paper based on these particular instructions?...with 100% confidentiality?

Let us assume that a sender sends messages with one letter from an alphabet which contains all the lower and upper case letters (a,b,c, …, z, A, B, …, Z). Let us assume that all the lower case letters have equal probability pLower, and that all the upper case letters have equal probability pUpper = pLower/10. Remember that the sum of the probabilities must be 1. Thus pLower + pLower/10 = 1/26 What is the information content of 1 message? What is the unit used? Invent an encoding (for all the letters of this alphabet) which uses as few bits as possible. Compare with the information content.

Let us assume that a sender sends messages with one letter from an alphabet which contains all the lower and upper case letters (a,b,c, …, z, A, B, …, Z). Let us assume that all the lower case letters have equal probability pLower, and that all the upper case letters have equal probability pUpper = pLower/10. Remember that the sum of the probabilities must be 1. Thus pLower + pLower/10 = 1/26 What is the information content of 1 message? What is the unit used? Invent an encoding (for all the letters of this alphabet) which uses as few bits as possible. Compare with the information content.

Interested in a PLAGIARISM-FREE paper based on these particular instructions?...with 100% confidentiality?