Problem 7.1: Phinding Palindromic Phrases Purpose: Learn string manipulation in the context of a simple program.For this problem, you will modify an existing program to be more flexible. Go to your copy of CheckPalindromicPhrase.ipynb from Lab Assignment 7. In the flavor of the work begun there, continue to modify the is_pal_phrase function to work for palindromic phrases and sentences by having itignore spacesignore case (upper versus lower)ignore common punctuation, that is the thirteen characters , ; : - ' " . ? ! ( ) [ ]For example, "a Toyota" and "Madam, I'm Adam." and "Was it a rat I saw?" should be identified as palindromes; ditto for "A man, a plan, a canal--Panama!" and "Madam (in Eden), I'm Adam." Comment every line you added, using the following format:# YOURINITIALS: your commentFor example, here is a line from my function using one of the lines suggested in LA7:s = s.replace(" ","") # MSB: remove spaces from stringA good plan of attack would be to add a line, comment it as to what it is doing, test it against the positive_test_cases by running the third block, debug, repeat. Next, IF THEY ARE NOT ALREADY THERE add two more tests to positive_test_cases for the phrases highlighted in blue above. Turn-In: Cut-and-paste of (1) just your commented is_pal_phrase function (2) just the output of the 25 positive test cases.CheckPalindromicPhrase.ipynb from Lab Assignment 7 has been copied below:-# boolean function returning True/False for# "Is s is a palindromic word or phrase?",# disregarding case, spaces, punctuationdef is_pal_phrase(s): return s == s[::-1]print(is_pal_phrase(""))print(is_pal_phrase("r"))print(is_pal_phrase(""))print(is_pal_phrase(""))print(is_pal_phrase("bad"))print(is_pal_phrase("dad"))print(is_pal_phrase("Dad"))print(is_pal_phrase("racecar"))print(is_pal_phrase("race car"))print(is_pal_phrase("A Toyota")) positive_test_cases = [ "I", "aa", "", "$#$", "dad", "Dad", "777", "deed", "s:eyes", "radar", "RADAR", "13|.|31", "ATOYOTA", "A Toyota", "Taco cat", "Don't nod", "I did, did I?", "madamimadam", "Madam, I'm Adam.", "able was I ere I saw elba", "Able was I, ere I saw Elba.", "a man, a plan aca nalp a ,nam a", "A man, a plan, a canal--Panama!",]passed = 0for t in positive_test_cases: if is_pal_phrase(t): #print(f"+ {t:32} IS palindromic phrase") print("+", t) passed += 1 else: #print(f"{t:32} NOT palindromic phrase") print("-", t)print(f" Passed {passed} of {len(positive_test_cases)} positive tests. ")

Question

Problem 7.1: Phinding Palindromic Phrases Purpose: Learn string manipulation in the context of a simple program.For this problem, you will modify an existing program to be more flexible. Go to your copy of CheckPalindromicPhrase.ipynb from Lab Assignment 7. In the flavor of the work begun there, continue to modify the is_pal_phrase function to work for palindromic phrases and sentences by having itignore spacesignore case (upper versus lower)ignore common punctuation, that is the thirteen characters , ; : - ' &#34; . ? ! ( ) [ ]For example, &#34;a Toyota&#34; and &#34;Madam, I'm Adam.&#34; and &#34;Was it a rat I saw?&#34; should be identified as palindromes; ditto for &#34;A man, a plan, a canal--Panama!&#34; and &#34;Madam (in Eden), I'm Adam.&#34; Comment every line you added, using the following format:# YOURINITIALS: your commentFor example, here is a line from my function using one of the lines suggested in LA7:s = s.replace(&#34; &#34;,&#34;&#34;)  # MSB: remove spaces from stringA good plan of attack would be to add a line, comment it as to what it is doing, test it against the positive_test_cases by running the third block, debug, repeat. Next, IF THEY ARE NOT ALREADY THERE add two more tests to positive_test_cases for the phrases highlighted in blue above. Turn-In:  Cut-and-paste of (1) just your commented is_pal_phrase function (2) just the output of the 25 positive test cases.CheckPalindromicPhrase.ipynb from Lab Assignment 7 has been copied below:-# boolean function returning True/False for# &#34;Is s is a palindromic word or phrase?&#34;,# disregarding case, spaces, punctuationdef is_pal_phrase(s):    return s == s[::-1]print(is_pal_phrase(&#34;&#34;))print(is_pal_phrase(&#34;r&#34;))print(is_pal_phrase(&#34;>>&#34;))print(is_pal_phrase(&#34;<>&#34;))print(is_pal_phrase(&#34;bad&#34;))print(is_pal_phrase(&#34;dad&#34;))print(is_pal_phrase(&#34;Dad&#34;))print(is_pal_phrase(&#34;racecar&#34;))print(is_pal_phrase(&#34;race car&#34;))print(is_pal_phrase(&#34;A Toyota&#34;)) positive_test_cases = [    &#34;I&#34;,    &#34;aa&#34;,    &#34;>>&#34;,    &#34;$#$&#34;,    &#34;dad&#34;,    &#34;Dad&#34;,    &#34;777&#34;,    &#34;deed&#34;,    &#34;s:eyes&#34;,    &#34;radar&#34;,    &#34;RADAR&#34;,    &#34;13|.|31&#34;,    &#34;ATOYOTA&#34;,    &#34;A Toyota&#34;,    &#34;Taco cat&#34;,    &#34;Don't nod&#34;,    &#34;I did, did I?&#34;,    &#34;madamimadam&#34;,    &#34;Madam, I'm Adam.&#34;,    &#34;able was I ere I saw elba&#34;,    &#34;Able was I, ere I saw Elba.&#34;,    &#34;a man, a plan aca nalp a ,nam a&#34;,    &#34;A man, a plan, a canal--Panama!&#34;,]passed = 0for t in positive_test_cases:    if is_pal_phrase(t):        #print(f&#34;+ {t:>32}  IS  palindromic phrase&#34;)        print(&#34;+&#34;, t)        passed += 1    else:        #print(f&#34;{t:>32}  NOT palindromic phrase&#34;)        print(&#34;-&#34;, t)print(f&#34;
Passed {passed} of {len(positive_test_cases)} positive tests.
&#34;)

Accepted Answer

# boolean function returning True/False for# "Is s is a palindromic word or phrase?",# disregarding…

In the flavor of the work begun there, continue to modify the is_pal_phrase function to work for palindromic phrases and sentences by having it ignore spaces ignore case (upper versus lower) ignore common punctuation, that is the thirteen characters , ; : - ' " . ? ! ( ) [ ]

Problem 7.1: Phinding Palindromic Phrases