In this challenge you will use the file regex_search_challenge_student. py to: 1.Write a regular expression that will find all occurrences of: ◦regular expression ◦regular-expression ◦regular:expression ◦regular&expression In the string: This is a string to search for a regular expression like regular expression or regular-expression or regular:expression or regular&expression 2.Assign the regular expression to a variable named pattern 3.Using the findall() method from the re package determine if there are occurrences in `search_string` ◦Assign the outcome of the findall() method to a variable called match1 4.If match1 is not None print to the console the pattern used to perform the match, followed by the word 'matched' 5.Otherwise Print to the console the pattern used to perform the match, followed by the words 'did not match' Regular Expression Search Challenge Using the Python string below to perform a search using a regular expression that you create. search_string=’’’This is a string to search for a regular expression like regular expression or regular-expression or regular:expression or regular&expression’’’ 1.Write a regular expression that will find all occurrences of: a. regular expression b. regular-expression c. regular:expression d. regular&expression in search_string 2.Assign the regular expression to a variable named pattern 3.Using the findall() method from the re package determine if there are occurrences in search_string 4.Assign the outcome of the findall() method to a variable called match1 5.If match1 is not None: a. Print to the console the pattern used to perform the match, followed by the word ‘matched’ 6.Otherwise: a. Print to the console the pattern used to perform the match, followed by the words ‘did not match’

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)

Melissa needs to add a topic to an email that she will send to her teacher. choose the name of the field where she should type her topic.

Hashtags serve to identify the topic of a given tweet true false