need help with assembky code, why does it return true for sinlge palindrome characters but not for things like 'dad' or 'madam': $.$section $.$data

input$\_$prompt: $.$asciz "Input a string: $"$

input$\_$spec: $.$asciz $"\%$s$"$

palindrome$\_$spec: $.$asciz "String is a palindrome $($T$/$F$)$: $\%$c

$"$

$.$section $.$text

$.$global main

main:

$//$ Print prompt for input

ldr x$0,=$input$\_$prompt

bl printf

$//$ Allocate $32$ bytes on the stack for input

sub sp$,$ sp$,$ #$32$

mov x$1,$ sp $//$ Buffer points to the top of the stack

$//$ Read the input string using scanf

ldr x$0,=$input$\_$spec

bl scanf

$//$ Call strlen to calculate string length

mov x$0,$ sp $//$ Buffer address $($now on the stack$)$

bl strlen

sub x$2,$ x$0,$ #$1//$ Set x$2$ to length $-1($last valid character index$)$

$//$ Call the recursive palindrome check

mov x$0,$ sp $//$ Buffer $($string address$)$

mov x$1,$ #$0//$ Initial start index

bl check$\_$palindrome

$//$ Check the result

cmp x$0,$ #$1$

bne not$\_$palindrome

mov w$1,\text{'}$T$\text{'}$

b print$\_$result

not$\_$palindrome:

mov w$1,\text{'}$F$\text{'}$

print$\_$result:

ldr x$0,=$palindrome$\_$spec

bl printf

b exit

exit:

add sp$,$ sp$,$ #$32//$ Restore the stack by freeing allocated memory

mov x$0,0$

mov x$8,93$

svc $0$

$//$ Recursive palindrome checking function

check$\_$palindrome:

$//$ Allocate $32$ bytes of stack space

sub sp$,$ sp$,$ #$32$

$//$ Save return address and arguments on the stack

stp x$30,$ x$1,[$sp$,$ #$16]//$ Save return address and x$1($start index$)$

stp x$0,$ x$2,[$sp$,$ #$0]//$ Save x$0($string pointer$)$ and x$2($end index$)$

$//$ Base case: start index $>=$ end index $($we$\text{'}$ve checked all characters$)$

cmp x$1,$ x$2$

bge palindrome$\_$true

$//$ Load characters at the start $($x$1)$ and end $($x$2)$ of the string

ldrb w$3,[$x$0,$ x$1]$

ldrb w$4,[$x$0,$ x$2]$

cmp w$3,$ w$4$

bne palindrome$\_$false $//$ If characters don't match, return false

$//$ Recursive case: move start forward, end backward

add x$1,$ x$1,$ #$1$

sub x$2,$ x$2,$ #$1$

$//$ Recursive call

bl check$\_$palindrome

$//$ Restore return address and arguments

ldp x$30,$ x$1,[$sp$,$ #$16]$

ldp x$0,$ x$2,[$sp$,$ #$0]$

$//$ Unwind the stack

add sp$,$ sp$,$ #$32$

ret

palindrome$\_$true:

$//$ Restore stack and return true $(1)$

add sp$,$ sp$,$ #$32$

mov x$0,$ #$1$

ret

palindrome$\_$false:

$//$ Restore stack and return false $(0)$

add sp$,$ sp$,$ #$32$

mov x$0,$ #$0$

ret