In x$86-64$ assembly language, write the definition of the function modulus that efficiently calculates the modulus of a signed integer division using only bitwise operations and without using the IDIV instruction? Assume the divisor is a power of $2.$ Hint$1$:Foranyintegerxandadivisor$2^$n$,$themodulusisequivalenttox&$(2^$n $-1).$

Hint$2$: For signed integers, we have to adjust for negative numbers to get the correct result$(-$x & $(2^$n $-1).$

$($You will get partial credit if you at least give an attempt$)$

The following is a skeleton code of the function modulus in assembly code, modulus.S$.$ Complete the code..

decode:

movl $\%$edi, $\%$eax

andl $\%$esi, $\%$edi

orl $\%$edi, $\%$eax

sall $\%$esi, $\%$eax

ret

$3.$

$.$global modulus

# $\%$edi holds v and $\%$esi holds n

movq $\%$edi, $\%$eax # move v to $\%$eax

movq $\%$esi, $\%$ecx # move n to $\%$ecx

# calculate $2^$n$-1$ to get the mask for modulus

# calculate the modulus operation. Put the result into $\%$eax

ret