An incomplete C program is given that asks an integer from the user and prints details about bitwise representation of the integer. Your task is to complete two functions $($named as 'number$\_$of$\_$setbits' and 'trailing$\_$zeros'$)$ defined below and given in $\text{'}$pe$3.$c$\text{'}$ source file.

Note that there are two other functions $($ 'printbitsofInteger' and 'leading$\_$zeros'$)$ given for your reference. The function called 'printbitsofInteger' prints the bits of the stored integer value and the function called 'leading$\_$zeros' returns the number of leading zeros of an integer.

Please do not edit anything other than the two function that you are expected to implement. Rest of the code is used to print results properly. See the sample result on the next page.

Instructions:

$-$ Step $0$: Copy the given file $"$pe$3.$c$"$ to your working directory.

$-$ Step $1$: Open the given $($incomplete$)$ C source code $($named as $"$pe$3.$c$")$ with vim by using the command: vim pe$3.$c

$($a$)$ Write a C function $(\text{'}$number$\_$of$\_$setbits'$)$ to return the number of set bits $(1$s$)$ in a given integer using bitwise operators.

$($b$)$ Write a C function $(\text{'}$trailing$\_$zeros'$)$ to return the number of trailing zeros in a given integer using bitwise operators. The trailing zeros is the number of consecutive zero bits in the least significant part of the stored integer.

Note: The functions are already provided at the end of the given file $("$pe$3.$c$")$ but they are incomplete. You are expected to complete them.

$-$ Step $2$: Build your executable program named as $"$pe$3"$ by using the command: gcc $-$o $3$ pe$3.$c

$-$ Step $3$: Run the program by using the command: $./$pe$3$

$-$ Step $4$: Test your code with the provided "test$3.$sh$"$ file by using the command: $./$test$3.$sh pe$3.$c

Note $1$: You should have the "test$3.$sh$"$ in the same directory as your source code.

Note $2$: You should see "PASS" for all the test cases.

$-$ Step $5$: Submit your source code $("$pe$3.$c$")$ to Learn.Hub $($assignment $"$PE$3").$

Sample Result

$```$

$[$Zafers$-$MacBook$-$Pro:src zafer$ $./$pe$3$s

Enter any integer: $256$

$000000000000000000000000100000000$

In $256,$ total number of set bits$(1$s$)$ is $=1,$ and unset bits $(0$s$)$ is $=31$

Total number of leading zeros in $256$ is $=23.$

Total number of trailing zeros in $256$ is $=8.$

$[$Zafers$-$MacBook$-$Pro:src zafer$ $./$pe$3$s

Enter any integer: $44$

$000000000000000000000000000101100$

In $44,$ total number of set bits$(1$s$)$ is $=3,$ and unset bits $(0$s$)$ is $=29$

Total number of leading zeros in $44$ is $=26.$

Total number of trailing zeros in $44$ is $=2.$

$[$Zafers$-$MacBook$-$Pro:src zafer$ $./$pe$3$s

Enter any integer: $0$

$000000000000000000000000000000000$

In $0,$ total number of set bits$(1$s$)$ is $=0,$ and unset bits $(0$s$)$ is $=32$

Total number of leading zeros in $0$ is $=32.$

Total number of trailing zeros in $0$ is $=32.$

$[$Zafers$-$MacBook$-$Pro:src zafer$ $./$pe$3$s

Enter any integer: $-1$

$111111111111111111111111111111111$

In $-1,$ total number of set bits$(1$s$)$ is $=32,$ and unset bits $(0$s$)$ is $=0$

Total number of leading zeros in $-1$ is $=0.$

Total number of trailing zeros in $-1$ is $=0.$

$[$Zafers$-$MacBook$-$Pro:src zafer$ $./$pe$3$s

Enter any integer: $-150$

$111111111111111111111111101101010$

In $-150,$ total number of set bits$(1$s$)$ is $=28,$ and unset bits $(0$s$)$ is $=4$

Total number of leading zeros in $-150$ is $=0.$

Total number of trailing zeros in $-150$ is $=1.$

$```$

$```$

$//$ DO NOT MODIFY ANYTHING OTHER THAN THE TWO

FUNCTIONS $($number$\_$of$\_$setbits and trailing$\_$zeros$)$

$//$ NOTE THAT THE TWO FUNCTIONS THAT YOU WILL

IMPLEMENT ARE AT THE END OF THIS FILE

#include

#define TBITNO $($int$)$sizeof$($int$)*8$

int trailing$\_$zeros$($int num$)$;

int number$\_$of$\_$setbits$($int$)$;

int leading$\_$z$$ros$($int num$)$;

void printbitsofInteger$($int x$)$;

int main$($void$)$

$\{$

$/*$ Declare variables to get user input $*/$

int num, ones, count $=0$;

$/*$ Get user input from the keyboard. $*/$

printf$("$Enter any integer: $")$;

scanf$("\%$d$",$ &num$)$;

$/*$ Print bits of the stored integer $*/$

printbitsofInteger$($num$)$;

$/*$ Compute number of set bits in num $*/$

ones $=$ number$\_$of$\_$setbits$($num$)$;

printf$("$In $\%$d$,$ t$$tal number of set bits$(1$s$)$ is

$=\%$d$,$ and unset bits $($Os$)$ is $=\%$d

$",$ num, ones,

TBITNO $-$ ones$)$;

printf$("$Total number of leading zeros in $\%$d is

$=\%$d$.$

$",$ num, leading$\_$zeros$($num$))$;

printf$("$Total number of trailing zeros in $\%$d is

$=\%$d$.$

$",$ num, trailing$\_$zeros$($num$))$;

return $0$;

$\}$

void printbitsofInteger$($int x$)$

$\{$

int i;

for $($i $=$ TBITNO $-1$; i $>=0$; i$--)$

$\{$

$($x & $(1$ i$))?$ putchar$(\text{'}1\text{'})$ :

putchar$(\text{'}0\text{'})$;

$\}$

printf$("$

$")$;

$\}$

int leading$\_$zeros$($int num$)$

$\{$

$``````$

$18$:$58$

$```$

printf$("$Total numb$$er of trailing zeros in $\backslash \%$d is $=\backslash \%$d$.$

$",$ num, trailing$\_$zeros$($num$))$;

return $0$;

$\backslash \}$

void printbitsofInteger$($int x$)$

$\backslash \{$

int i;

for $($i $=$ TBITNO $-1$; i $>=0$; i$--)$

$\backslash \{$

putchar$((\text{'}0\text{'})$;

$\backslash \}$

printf$("$

$")$;

$\backslash \}$

int leading$\_$zeros$($int num$)$

$\backslash \{$

int msb TBITNO $-1)$;

int count $\backslash (=0\backslash )$;

$/*$ Iterate over each bit $*/$

for $($int i $=0$; i $$ TBITNO; i$++)$

$\backslash \{$

$/*$ If leading set bit is found $*/$

if $(($num $$ i$)\backslash$& msb$)$

$\backslash \{$

$/*$ Terminate the loop $*/$

break;

$\backslash \}$

$\backslash \}$

count$++$;

return count;

$\backslash \}$

$//$ DO NOT MODIFY ANYTHING ABOVE THIS LINE

int number$\_$of$\_$setbits$($int num$)$

$\backslash \{$

$//$ Write a function to return the number of set bits $(1$s$)$ in integer num.

$/*$ YOUR CODE GOES HERE $*/$

return $0$; $//$ Don't forget to update th