Write a program, using your favorite computer (under some operating systems, supporting vmm) and your favorite programming language, to implement the algorithm on p. 126 for n = 16, 64, 256, 1024, 4096, and 16384, and for two values for m, m = 1,677,721,600 and m = 13,421,772,800 (that is, m does not depend on n). determine the timing for your twelve instances. what should be the computational complexity of the twelve runs? "

Write a program that has a conversation with the user. the program must ask for both strings and numbers as input. the program must ask for at least 4 different inputs from the user. the program must reuse at least 3 inputs in what it displays on the screen. the program must perform some form of arithmetic operation on the numbers the user inputs. turn in your .py file as well as a screenshot of your program's output. include comments in your code to explain how it works an example program run might look like (have fun with this and be creative): ‘what is your name? ’ “josh” ‘, josh. what is your favorite color? ’ “green” ‘mine too. do you also like ice cream? ’ “no” ‘josh, how old are you? ’ “40” ‘ and how many siblings do you have? ’’ “3” ‘that means you are one of 4 kid(s). is green the favorite color of anyone else in your house? ’