python problem

1) Construct a recursive pure function to display a string in its reverse order on the console. Again, this is a pure function (procedure) that takes in a string: def reverse_string (my_str): and, given a string of characters such as: reverse_string("olleh"); will output the following to the console (do this by testing your pure function): hello Construct the reverse_string function: a. Start by identifying a base case that is trivial to solve. Write the Python statement or statements to implement the base case and return. b. Next, determine if there is some way that the original problem can be represented as a simple sub problem combined with some simple operation. Write the Python statement or statements that will return the "rightmost" string character of the original string. c. Now, write the recursive reduction step that calls the function for the "rest of the characters in the string". d. Combining these two steps forms the complete reduction case. If this is the only reduction step, it is simply performed for any but the base case(s). Complete the else clause from a) to form the entire reduction step. e. Before you complete and test the function, take a minute to ensure that a) the base case represents a correct solution, and b) the reduction step is guaranteed to get you "closer" to the base case. Now combine the base and reduction steps and write the complete function definition