ok please fix this errors that this program is having.

the main issue its counding non$-$palindromes as palindromes

here is the current code that i have for this program, please give me the completed subroutines or the whole program.

Note: Please make sure the palindrome subroutine is using recursion, IT MUST USE RECURSION!

thanks: $($attached is the palindrome subroutine pdf to fix$)$

$.$ORIG x$3000.$ORIG $3400$

palindrome

ADD R$6,$ R$6,$ #$-1$ ; Backup

; Initialize stack

LD R$6,$ stack$\_$addr

; Call main subroutine

LEA R$5,$ main

JSRR R$5$

; Halt the program

HALT

;$---------------------------------------------------------------------------------$

; Main Subroutine

;$---------------------------------------------------------------------------------$

main

; Call subroutine to get user input

LEA R$0,$ user$\_$prompt

PUTS

LEA R$1,$ user$\_$string

JSR get$\_$user$\_$string

; Call subroutine to calculate string length

LEA R$1,$ user$\_$string

JSR strlen

; Call recursive palindrome subroutine

LEA R$1,$ user$\_$string

ADD R$2,$ R$1,$ R$0$ ; Calculate the address of the last character

ADD R$2,$ R$2,$ #$-1$

JSR palindrome

; Check if the result is $1($true$)$ and print appropriate message

ADD R$3,$ R$0,$ #$0$

BRz not$\_$palindrome

LEA R$0,$ result$\_$string

PUTS ; Print $$The string is $$

LEA R$0,$ final$\_$string

PUTS ; Print $$a palindrome$$

BR end$\_$program

not$\_$palindrome

LEA R$0,$ result$\_$string

PUTS ; Print $$The string is $$

LEA R$0,$ not$\_$string

PUTS ; Print $$not $$

LEA R$0,$ final$\_$string

PUTS ; Print $$a palindrome$$

end$\_$program

HALT

;$---------------------------------------------------------------------------------$

; Required labels$/$addresses

;$---------------------------------------------------------------------------------$

; Stack address $**$ DO NOT CHANGE $**$

stack$\_$addr $.$FILL xFE$00$

; Addresses of subroutines, other than main

get$\_$user$\_$string$\_$addr $.$FILL x$3200$

strlen$\_$addr $.$FILL x$3300$

palindrome$\_$addr $.$FILL x$3400$

; Reserve memory for strings in the progrtam

user$\_$prompt $.$STRINGZ "Enter a string: $"$

result$\_$string $.$STRINGZ "The string is $"$

not$\_$string $.$STRINGZ "not $"$

final$\_$string $.$STRINGZ "a palindrome

$"$

; Reserve memory for user input string

user$\_$string $.$BLKW $150$

$.$END

;$---------------------------------------------------------------------------------$

; get$\_$user$\_$string

;$---------------------------------------------------------------------------------$

; Description: Prompts the user for a string and stores it at a specified memory address.

; Input: R$1-$ Address of the user prompt string.

; R$2-$ Address where the user string should be stored.

; Output: None.

;$---------------------------------------------------------------------------------$

$.$ORIG x$3200$

get$\_$user$\_$string

ADD R$6,$ R$6,$ #$-1$ ; Backup R$7$

STR R$7,$ R$6,$ #$0$

ADD R$6,$ R$6,$ #$-1$ ; Backup R$2$

STR R$2,$ R$6,$ #$0$

ADD R$6,$ R$6,$ #$-1$ ; Backup R$1$

STR R$1,$ R$6,$ #$0$

; Loop to get user input

get$\_$char$\_$loop

GETC ; Get user input

OUT ; Echo the character

ADD R$3,$ R$0,$ #$0$ ; Copy input character to R$3$

ADD R$3,$ R$3,$ #$-10$ ; Check if Enter key $($newline$,$ ASCII $0$x$0$A$)$ is pressed

BRz end$\_$input ; If Enter key is pressed, end input

STR R$0,$ R$1,$ #$0$ ; Store character in memory

ADD R$1,$ R$1,$ #$1$ ; Move to next memory location

BR get$\_$char$\_$loop ; Repeat the loop to get next character

end$\_$input

AND R$0,$ R$0,$ #$0$ ; Set R$0$ to zero $($zero terminator$)$

STR R$0,$ R$1,$ #$0$ ; Append zero terminator to string

LDR R$1,$ R$6,$ #$0$ ; Restore R$1$

ADD R$6,$ R$6,$ #$1$

LDR R$2,$ R$6,$ #$0$ ; Restore R$2$

ADD R$6,$ R$6,$ #$1$

LDR R$7,$ R$6,$ #$0$ ; Restore R$7$

ADD R$6,$ R$6,$ #$1$

RET

$.$END

;$---------------------------------------------------------------------------------$

; strlen

;$---------------------------------------------------------------------------------$

; Description: Computes the length of a zero$-$terminated string.

; Input: R$1-$ Address of the zero$-$terminated string.

; Output: R$0-$ Length of the string $($number of non$-$zero characters$).$

;$---------------------------------------------------------------------------------$

$.$ORIG x$3300$

strlen

ADD R$6,$ R$6,$ #$-1$ ; BackupR$7$

STR R$7,$ R$6,$ #$0$

ADD R$6,$ R$6,$ #$-1$ ; Backup R$3$

STR R$3,$ R$6,$ #$0$

ADD R$6,$ R$6,$ #$-1$ ; Backup R$1$

STR R$1,$ R$6,$ #$0$

AND R$0,$ R$0,$ #$0$ ; Initialize length counter

LD R$2,$ neg$\_$newline$\_$sub$2$

iterate

LDR R$3,$ R$1,$ #$0$ ; Load character

ADD R$3,$ R$2,$ R$3$ ; Move to the next character

BRz end$\_$iterate ; Check if null terminator is reached

ADD R$0,$ R$0,$ #$1$ ; Increment length counter

ADD R$1,$ R$1,$ #$1$

BR iterate

end$\_$iterate

LDR R$1,$ R$6,$ #$0$ ; Restore R$1$

ADD R$6,$ R$6,$ #$1$

LDR R$3,$ R$6,$ #$0$ ; Restore R$3$