Well detailed answers and explanation for the following question:

Exercise 4: Entropy, Combinatorics and the AEP a) The logarithm of the factorial of t, i.e. t!, can be approximated as Int! ~ tInt for large t E N, which is called Stirling's approximation. Assuming that this approximation is always valid, show that h(k) ~ 1 In ("), where k, n e N, k