1. An English word is called palindrome if its meaning may be interpreted the same way in either forward or reverse direction. Some examples of common palindromic words: civic, radar, level, rotor, noon, etc. Design an algorithm that takes a word as input and decides if the input word is palindrome. In your algorithm, a stack should be used. Describe the pseudo-code of your algorithm. What is the time complexity of your algorithm in big-O?

ANSWER SHOULD BE ALGORITHM FORM. I DONOT NEED CODE.

2. Given a new element e1 and an element e2 stored in a singly linked list, design an

algorithm to insert e1 before e2 (if e2 is not in the list, insert e1 at the tail). Give the

pseudo code of your algorithm and analyze its time complexity in big-O.