Thanks in advance, show the process in getting the answer

Show that an n-element heap has height [log n] Show that there are at most fn/2h+1 nodes of height h in any n-element heap