Write a procedure is$\_$little$\_$endian that will return $1$ when compiled and run on a little$-$endian machine, and will Write C expressions that evaluate to $1$ when the following conditions are true and to o when they are false. Assume

$x$ is of type int.

A$.$ Any bit of $x$ equals $1.$

B$.$ Any bit of $x$ equals $0.$

C$.$ Any bit in the least significant byte of $x$ equals $1.$

D$.$ Any bit in the most significant byte of $x$ equals $0.$

Your code should follow the bit$-$level integer coding rules $($page $128),$ with the additional restriction that you may not

use equality $(==)$ or inequality $()$ tests. Write code to implement the following function:

$/*$ Return $1$ when any odd bit of $x$ equals $1$ ; $0$ otherwise.

Assume $W=32\frac{*}{?}$

int any$\_$odd$\_$one$($unsigned $x)$;

Your function should follow the bit$-$level integer coding rules $($page $128),$ except that you may assume that data type

int has $w=32$ bits.

return o when compiled and run on a big$-$endian machine. This program should run on any machine, regardless of its

word size.

Write a C expression that will yield a word consisting of the least significant byte of $x$ and the remaining bytes of $y.$

For operands $x=0x89$ABCDEF and $y=0x76543210,$ this would give $0$x$765432$EF$.$

Suppose we number the bytes in a $w-$bit word from o $($least significant$)$ to $\frac{w}{8}-1($most significant$).$ Write code for

the following $C$ function, which will return an unsigned value in which byte $i$ of argument $x$ has been replaced by

byte b:

unsigned replace$\_$byte $($unsigned $x,$ int $i,$ unsigned char b$)$;

Here are some examples showing how the function should work:

replace$\_$byte $(012345678,2,0$xAB$)-012AB5678$

replace$\_$byte$(0$x$12345678,0,0$xAB$)-->0$x$123456$AB