PLEASE ANSWER RUN USING PLP TO VERIFY IT WORKS! THE TEMPLATE BELOW SHOULD BE USED.

The Task 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. Print Function A template PLP project file is available to download on Canvas. The PLP project includes a second ASM file titled, project3_lib.asm. This ASM file contains the print function used in this project. PLPTool concatenates all ASM files within a PLP project into a single location in memory (unless additional .org statements have been added to specify different location for code). No changes to project3_lib.asm should be made. When called, depending on the value in register $a0, the following string will be displayed on the simulated UART device's output. If $a0 contains a zero then "No" will be displayed and if $aO contains a non-zero value (e.g. one) then "Yes" will be displayed. The print function is called using the following instruction: To use the print function, your PLP program needs to initialize the stack pointer ($Sp) before performing the function call (or any other operations involving the stack pointer). For this reason, the template project file includes an initialization that sets the stack pointer to 010fffffc (the last address of RAM). Template Structure The template project file contains six function stubs that need to be implemented. Five are called from the main loop and the sixth is called from "period_check". The template file contains comments with descriptions of what each function needs to do and how it should be implemented. The table below provides a brief description of the functions. Debugging Tools To show that you properly tested your program, please save your program while it is in simulation mode (the blue simulation mode button has been toggled on) such that a CPU Memory Visualization window is open and shows at least the first 6 words of memory in the array. Please keep in mind that the starting address of the array is relative to the number of initializations placed before the assembler directive allocating space for the array. If you change your initializations you may need to adjust your CPU Memory Visualization base address. The Array Example video in this project's module demonstrates how to set up a CPU Memory Visualization window. It is acceptable to also see program contents in memory (these cells will be colored blue). For example, it would be acceptable to see the following in the visualizer after the string, "abcd.", has been sent by the user. Additionally, the watcher window should contain, at minimum, registers $v0,$s1, and $s2. You may also include any other registers in the watcher window that you find useful for debugging. Points will be deducted if a CPU Memory Visualization window configured to show the start of the array does not open when simulation mode is toggled on or the watcher window does not include the minimum set of registers (the watcher window does not need to open when simulation mode is toggled on). \# The "poll_UART" function should poll the status register of the UART. \# If the 21 bit position (ready bit) is set to 1 then it \# should copy the receive buffer's value into \$v0 and send \# a clear status command (21) to the command register before \# returning (a return statement is already included). In order to \# receive full credit, $s0 must contain the base address of the UART \# and must be used with the appropriate offsets to access UART \# registers and buffers pol1 UART : \# The "period_check" function should check if the current character (\$v0) \# 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: \# The "space_check" function should check if the current character (\$v0) \# 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: \# The "case_check" function should perform a single inequality check. \# If the current character (\$v0) is greater than the ASCII value of 'Z', \# which indicates the current character is lowercase, then it should convert \# the value of \$v0 to the uppercase equivalent and then return. If the \# current character (\$v0) is already uppercase (meaning the inequality \# mentioned before was not true) then the function should return without \# performing a conversion. case check: \# The "array_push" function should save the current character (\$v0) to the * current location of the tail pointer, \$s2. 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: \# The "array_push" function should save the current character (\$v0) to the * current location of the tail pointer, $s2. 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$ranop \# The "palindrome_check" subroutine should be jumped to by the period \# check function if a period is encountered. This subroutine should contain \# a loop that traverses the array from the front towards the back (using the \# head pointer, $s1 ) and from the back towards the front (using the tail \# pointer, $s2). If the string is a palindrome then as the array is traversed \# the characters pointed to should be equal. If the characters are not equal \# then the string is not a palindrome and the print function should be used \# to print "No". If the pointers cross (i.e. the head pointer's address is * greater than or equal to the tail pointer's address) and the compared \# characters are equal then the string is a palindrome and "Yes" should be \# printed. * Remember to restore the head and tail pointers to the first element \# of the array before the subroutine jumps back to main to begin processing the \# next string. Also, keep in mind that because the tail pointer is updated at \# the end of "array_push" it technically points one element past the last \# character in the array. You will need to compensate for this by either \# decrementing the pointer once at the start of the array or using an offset \# from this pointer's address. palindrome_check: j main nop