SOLVED: Create the flowchart, pseudocode, and Nassi-Shneiderman diagram that shows the steps to determine if a string of characters (a - z) is a palindrome. The algorithm used to solve this problem uses the following steps:1. Get the number of characters in the input string.2. Loop through the string until you get to the middle. In each loop, check if the character matches the character on the opposite side of the string.2a. If the characters match all the way through until the middle, then the

UML Diagram - Everything You Need to Know About UML Diagrams