Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$
int kickstart(int a,int b,int c)
{
if(B1) return a;
if(a>=b) return B2;
return kickstart(c,a,b);
}
How the boxes filled up correctly?
$I)B1:a\geq b$ && $a> c, B2:kickstart\left ( c,b,a \right );$
$II)B1:a\geq b$. &&. $a\geq c, B2:kickstart\left ( c,b,a \right );$
$III)B1:a\geq b$ && $a\geq c, B2:kickstart\left ( c,a,b \right );$
$IV)B1:a\geq b$ && $a\geq c, B2:kickstart\left ( b,c,a \right );$
Is it $I) and II)$ or $I) and IV)$