Consider a heap of height h$.$

$($a$)$ Find the maximum number of nodes on the left subtree of the root of the heap.

$($b$)$ Find the maximum number of nodes on the right subtree of the root of the heap.

$($c$)$ Find the minimum number of nodes on the left subtree of the root of the heap.

$($d$)$ Find the minimum number of nodes on the right subtree of the root of the heap. use this example below to prove the solution $16$

$/\backslash$

$1410$

$/\backslash /\backslash$

$8793$

$/\backslash$

$24$

$/$

$1$