With this program with the solution you provided, I get these mismatch errors, please can you fix them?

asm$-$test.s: Assembler messages: asm$-$test.s:$91$: Error: operand type mismatch for shl$\text{'}$ asm$-$test.s:$104$: Error: operand type mismatch for shr$\text{'}$

Here is the code:

$.$section $.$data

limit: $.$long $10000$ # upper limit for primes

prime$\_$count: $.$long $0$ # count of primes found

newline: $.$asciz $"$

$"$

output$\_$fmt: $.$asciz $"\%7$d $"$

array$\_$size: $.$long $10000$ # size of the array

$.$section $.$bss

$.$lcomm primes, $1250$ # allocate $10,000$ bits $(10,000/8=1250$ bytes$)$

$.$section $.$text

$.$global $\_$start

# Initialize primes array and setup

$\_$start:

# Prompt for limit $($optional$)$

# Initialize array to all zeros $($assume all are prime$)$

movq $$0,\%$rax

movq $primes, $\%$rdi

movq $$1250,\%$rcx # $1250$ bytes for $10,000$ bits

init$\_$loop:

movb $$0,(\%$rdi$)$ # clear byte

incq $\%$rdi

loop init$\_$loop

# Mark multiples of $2($even numbers$)$

movq $$2,\%$rdi # start from $2$

call mark$\_$multiples

# Begin sieve, marking multiples of each found prime

movq $$3,\%$rdi # start from $3$

sieve$\_$loop:

cmpq limit$,\%$rdi # if current prime $>=$ limit$,$ stop

jge done$\_$sieve

call is$\_$prime # check if number is prime

testq $\%$rax, $\%$rax

jz not$\_$prime

call mark$\_$multiples # mark all multiples of this prime

not$\_$prime:

addq $$2,\%$rdi # increment to next odd number

jmp sieve$\_$loop

done$\_$sieve:

# Print the first $200$ primes

movq $$0,\%$rdi # start index for printing

movq $$0,\%$rbx # reset prime count

print$\_$primes:

call is$\_$prime

testq $\%$rax, $\%$rax

jz skip$\_$print

movq $\%$rdi, $\%$rsi # pass number to printf

movq $output$\_$fmt$,\%$rdi

call printf

incq $\%$rbx # increment prime count

cmpq $$200,\%$rbx # stop at $200$ primes

je done

skip$\_$print:

incq $\%$rdi # next number

cmpq limit$,\%$rdi # check if within limit

jl print$\_$primes

done:

# Exit program

movq $$60,\%$rax # sys$\_$exit system call

xorq $\%$rdi, $\%$rdi # status $0$

syscall

# Function to mark multiples of a given number as non$-$prime

# Input: $\%$rdi $=$ current prime

mark$\_$multiples:

movq $\%$rdi, $\%$rax

imulq $\%$rdi, $\%$rax # start with square of $\%$rdi

mark$\_$loop:

cmpq limit$,\%$rax # stop if multiple exceeds limit

jge end$\_$mark

call clear$\_$bit # mark as non$-$prime

addq $\%$rdi, $\%$rax # next multiple

jmp mark$\_$loop

end$\_$mark:

ret

# Function to clear bit for a non$-$prime number

# Input: $\%$rdi $=$ index to clear

clear$\_$bit:

movq $\%$rax, $\%$rcx

shrq $$3,\%$rcx # divide by $8$ to get byte index

movq $\%$rax, $\%$rdx

andq $$7,\%$rdx # modulus $8$ for bit position

movb $$1,\%$bl

shlq $\%$rdx$,\%$rbx # shift $1$ by $\%$rdx positions

orq $\%$rbx$,$ primes$(\%$rcx$)$ # set bit to mark as non$-$prime

ret

# Function to check if number is prime $($bit is clear$)$

# Input: $\%$rdi $=$ number to check

# Output: $\%$rax $=1$ if prime, $0$ if not prime

is$\_$prime:

movq $\%$rdi, $\%$rax

shrq $$3,\%$rcx # divide by $8$ for byte index

movq $\%$rdi, $\%$rdx

andq $$7,\%$rdx # modulus $8$ for bit position

movb primes$(\%$rcx$),\%$bl

shrq $\%$rdx$,\%$rbx # shift bit down

andq $$1,\%$rbx # isolate target bit

xorq $\%$rax, $\%$rax # assume non$-$prime $(0)$

testq $\%$rbx$,\%$rbx

setz $\%$al # if bit clear, set $\%$rax to $1$

ret