to if you need reminderwhat can you do about negativesand the values and how about speeding this upyour outputs should look something like this is prime is prime has factor has factor iterations and comprehensions write code to build new list containing the square roots of all the numbers in this list[ code this as for loop firstthen as map callthen as list comprehensionand finally as generator expression use the sqrt function in the built-in math module to do the calculation ( import math and say math sqrt( )of the fourwhich approach do you like best timing tools in we saw three ways to compute square rootsmath sqrt( ) * and pow( if your programs run lot of thesetheir relative performance might become important to see which is quickestrepurpose the timerseqs py script we wrote in this to time each of these three tools use the bestof or bestoftotal functions in one of this timer modules to test (you can use either the originalthe -only keyword-only variantor the versionand may use python' timeit module as wellyou might also want to repackage the testing code in this script for better reusability--by passing test functions tuple to general tester functionfor example (for this exercise copyand-modify approach is finewhich of the three square root tools seems to run fastest on your machine and python in generalfinallyhow might you go about interactively timing the speed of dictionary comprehensions versus for loops recursive functions write simple recursion function named countdown that prints numbers as it counts down to zero for examplea call countdown( will print stop there' no obvious reason to code this with an explicit stack or queuebut what about nonfunction approachwould generator make sense here computing factorials finallya computer science classic (but demonstrative nonethelesswe employed the notion of factorials in ' coverage of permutationsn!computed as *( - )*( - ) for instance is * * * * * or code and time four functions thatfor call fact( )each return ncode these four functions ( as recursive countdown per ( using the functional reduce call per ( with simple iterative counter loop per and ( using the math factorial library tool per use ' timeit to time each of your functions what conclusions can you draw from your resultstest your knowledgepart iv exercises