In this project, you will be writing a program that receives a string of characters via the UART, checks if this string is a palindrome, and then uses a print function to print either $$Yes$$ or $$No$.$ A palindrome is a sequence of characters $($typically a word or phrase$)$ that is the same both forwards and backwards. For this project, strings will be terminated using a period $(.).$ You may assume that a string will contain at least one letter in addition to a period $($e$.$g$.,$ the input, $$b$.,$ should be considered a palindrome$).$ You will not need to handle empty strings, strings containing only a period, or stings containing characters other than letters, spaces, and periods. Your program should be able to handle multiple strings sent one after another or concatenated together. For example, the string: $$abba$.$ data.$$ should print $$Yes$$ followed by $$No$$ on the next line. Spaces should be ignored when checking for a palindrome and the palindrome should not be case sensitive$.$ For example, $$A nut for a jar of Tuna.$$ would be considered a palindrome.

This is the template file.

$.$org $0$x$10000000$

# Initializations

# NOTE: You may add initializations after line $10,$ but please do not

# remove or change the initializations to $sp$,$ $s$0,$ $s$1,$ or $s$2$

li $sp$,0$x$10$fffffc # Starting address of empty stack

li $s$0,0$xf$0000000$ # UART base address

li $s$1,$ array$\_$ptr # Array head pointer

li $s$2,$ array$\_$ptr # Array tail pointer

####################################################################

# Do not make changes to the jump to main, the allocation of

# memory for the array, or the main loop

####################################################################

j main

nop

array$\_$ptr: # Label pointing to $100$ word array

$.$space $100$

main:

jal poll$\_$UART

nop

jal period$\_$check

nop

jal space$\_$check

nop

jal case$\_$check

nop

jal array$\_$push

nop

j main

nop

####################################################################

# $******************************************************************$

####################################################################

# The "poll$\_$UART" function should poll the status register of the UART.

# If the $2^1$ bit position $($ready bit$)$ is set to $1$ then it

# should copy the receive buffer's value into $v$0$ and send

# a clear status command $(2^1)$ to the command register before

# returning $($a return statement is already included$).$ In order to

# receive full credit, $s$0$ must contain the base address of the UART

# and must be used with the appropriate offsets to access UART

# registers and buffers

poll$\_$UART:

jr $ra

nop

# The "period$\_$check" function should check if the current character $($$v$0)$

# is a period $(".").$ If it is a period then the function should go to the

# label, "palindrome$\_$check". If the character is not a period then it

# should use the included return.

period$\_$check:

jr $ra

nop

# The "space$\_$check" function should check if the current character $($$v$0)$

# is a space $("").$ If it is then it should jump to "main" so

# that it skips saving the space character. If not it should

# use the included return.

space$\_$check:

jr $ra

nop

# The "case$\_$check" function should perform a single inequality check.

# If the current character $($$v$0)$ is greater than the ASCII value of $\text{'}$Z$\text{'},$

# which indicates the current character is lowercase, then it should convert

# the value of $v$0$ to the uppercase equivalent and then return. If the

# current character $($$v$0)$ is already uppercase $($meaning the inequality

# mentioned before was not true$)$ then the function should return without

# performing a conversion.

case$\_$check:

jr $ra

nop

# The "array$\_$push" function should save the current character $($$v$0)$ to the

# current location of the tail pointer, $s$2.$ Then it should increment the

# tail pointer so that it points to the next element of the array. Last

# it should use the included return statement.

array$\_$push:

jr $ra

nop

# The "palindrome$\_$check" subroutine should be jumpe