The maximum number of nodes on level i of a binary tree is:

What is the output of the following program segment
main(){
$\mathrm{float} a, b, c, X, Y, Z;$

$a=9; b=12; c=3;$

$X=a- b/3 + c * 2 - 1;$

$Y=a- b/\left(3+c\right) * \left(2 - 1\right);$

$Z=a-\left(b/\left(3+c\right) * 2\right)- 1;$

$\mathrm{printf} \left("X=\%f\backslash nY=\%f\backslash nZ=\%f",X,Y,Z\right);$
}