Write and test the following function that uses a Stack:

def is$\_$palindrome$\_$stack$($string$)$:

$"$n$"$

Determines if string is a palindrome. Ignores case, digits, spaces, and

punctuation in string.

Use: palindrome $=$ is$\_$palindrome$\_$stack$($string$)$

Parameters:

string $-$ a string $($str$)$

Returns:

palindrome $-$ True if string is a palindrome, False otherwise $($bool$)$

un$"$

Add this function to the PyDev module

functions.py$.$ Test it from

t$05.$py$.$

The function must use one and only one stack to solve the problem. Show enough tests to cover two palindromes and an non$-$palindrome.

Examples of valid palindromes:

racecar

Otto

Able was I ere I saw Elba

A man, a plan, a canal, Panama!