Solve it using !,~,&,^,|,+,> and without using loops .

Q 2-1 / 4 k:@ 13% D2 of the functions Points Max Ops Description x &y using only Get byte n from x Name bitAnd (x, y) getByte (x, n) logicalShift (x, n) Shift right logical bitCount (x) bang (x) and 20 40 12 unt the number ot Compute x without using otor. 4 Table 1: Bit-Level Manipulation Functions. 3.2 Two's Complement Arithmetic Table 2 describes a set of functions that make use of the two's complement representation of integers. Again, refer to the comments in bitslab.c for more information. Points Max Ops Name tmin() fitsBits (x,n) divpwr2 (x, n) negate (x) isPositive (x) isLessOrEqual(x,y) | x