I need help solving these $4$ masm assembly x$86$ coding questionsProblems

Short Exercises:

Write a program to calculate the parity of a $32-$bit memory operand. The formula for calculating the parity of

a binary number is to XOR all the bits together. Refer to section $6\mathrm{.}1\mathrm{.}5$

Test with two double words and display on the screen if odd or even parity. Take a screenshot of the

output. $(10$ points$)$

$2.$Given two bit$-$mapped sets named SetX and SetY, write a program that generates a bit string in EAX that

represents members in SetX that are not members of SetY. Only use a boolean instruction. Display EAX and take

a screenshot. $(10$ points$)$

Example: SETX: $11001100$ SETY: $11000011$ EAX: $00001111$ Members in SetX not in SetY

Write a program that jumps to label L$1$ when the unsigned integer in DX is less than or equal to the integer in

CX$.$ When you jump to L$1,$ display the value in DX and CX and a message saying that it is less than or equal to$.$

Take a screenshot of the output.$(15$ points$)$

Example Display: $Dx=3,Cx=5,Dx$ is less than or equal to $Cx($Test with numbers that are equal to

each other$)$

Write a program that first clears bits $0$ and $1$ in AL$.$ Then, if the destination operand is equal to zero, the code

should jump to label L$3.$ Otherwise, it should jump to label L$4.$ at L$3$: Display "Equal to zero" at L$4$: Display "Not

Equal to zero" Test with both outcomes and take a screenshot of each output.$(15$ points$)$

Example: $AL=11111111$ after bits $0$ and $1$ cleared $AL=11111100$ Would jump to $L4$