4. (a) Suppose you have a whole chocolate bar composed of n > 1 individual pieces. Prove that the minimum number of breaks to divide the chocolate bar into n pieces is n - 1. (b) Show that for fibonacci numbers Eiff41 Recall that the fibonacci numbers are defined as fo = 0, 1 = 1 Un > 1, fo=fn-+ In-2 (e) For which nonnegative integers n is 3n+2