Cryptology Question

Assume that the entropy of English words is 1.25 bits per letter. Paul has a nine letter secret key ********* which is known to be an English word. (a) Approximately what is the entropy of Paul's secret key if he only uses small letters? Example: axiomatic (b) Approximately what is the entropy of Paul's secret key if he only uses a random mix of small and capital letters? Exam- ple: axI0mAtiC (c) If in addition to using random capitals as in the previous part, he then inserts one of sixteen possible special characters between two of the letters of his key, what is the approximate entropy of his key? Example: axiOmA@tiC Assume that the entropy of English words is 1.25 bits per letter. Paul has a nine letter secret key ********* which is known to be an English word. (a) Approximately what is the entropy of Paul's secret key if he only uses small letters? Example: axiomatic (b) Approximately what is the entropy of Paul's secret key if he only uses a random mix of small and capital letters? Exam- ple: axI0mAtiC (c) If in addition to using random capitals as in the previous part, he then inserts one of sixteen possible special characters between two of the letters of his key, what is the approximate entropy of his key? Example: axiOmA@tiC