P$4.(10$ pts $)$ Prove the following statements regarding the maximum item in a min binary heap $($don$\text{'}$t have to show a formal proof but, at least, you need to clearly justify your answers$)$:

a$.$ There are exactly $|$~$\frac{N}{2}$~$|$ leaves in a binary heap.

b$.$ Every leaf must be examined to find the max item in