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?