Discuss the below:
Q: In English like pseudo-code, or structured English -- just to make sure everyone can read it; write an algorithm to determine if a string is a palindrome. A palindrome is a word or phrase that is spelled the same whether you are reading it forwards or backwards (ex. race car, Madam I'm Adam). Your algorithm should ignore spaces and punctuation. Make sure to clearly state your assumptions before presenting your answer and to justify your use of data structure: what data structure did you choose (from lists, stacks, queues or trees) and why, and briefly explain why you did not choose the others