URGENT please

(a) Consider a long binary string of length N. Let a = Number of 0's, (N - a) = Number of 1's and HCXW) is the entropy of the string. Show that the total information content inX'V is: I(XN) =NlogN{a toga +(Na) log(Na)} (10 points) (b) What will be 1(XN) if: (10 points) 0 The number of 0's in the string is N/2 ? o The string is all 1's