You are facing a high wall that stretches infinitely in both directions. There is a door in thewall, but you don’t know how far away, or in which direction it is. It is pitch dark, but you have a very dimlighted candle that will enable you to see the door while you are immediately next to it. Show that thereis an algorithm that enables you to find the door by walking at mostO(n) steps, wherenis the numberof steps that you would have taken if you knew where the door is and walked directly to it. What is theconstant multiple in the big-O bound for your algorithm?

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? ’