Solve the $5$ puzzles given. Each is worth $4$ points.

int logicalShift$($int x$,$ int n$)$;

$//$ Shift right logical$.$

int bitParity$($int x$)$;

$//$ returns $1$ if x contains an odd number of $0\text{'}$s

int bang$($int x$)$;

$//$ Compute $!$ x without using $!$

int isPositive$($int x$)$;

$//$ Is x $>0?$

int isLessOrEqual$($int x$,$ int y$)$;

$//$ Is x $<=$ y$?$

Solve the programming puzzles above by writing a well$-$formed function definition. You may only use $!,$ ~$,|,$ &$,^,+,<<,$ and $>>.$ You may only use $1$ byte, hexadecimal constants.

You may not use control structures such as if$,$ then, else, for, while, do$-$while loops, switch, etc.