Verify that your implementation works properly by writing two test cases for the function you completed in part 2a. provide screenshot(s) with the results of your testing. (c) write a recurrence relation that represents your algorithm. (d) solve the recurrence relation using the iterating or recursive tree method to obtain the running time of the algorithm in big-o notation.