Here is the problem: you are facing a high wall that stretches infinitelyin both directions. there is a door in the wall, but you don't knowhow far away or in which direction. it is pitch dark, but you havea very dim lighted candle that will enable you to see the door whenyou are right next to it. show that there is an algorithm thatenables you to find the door by walking at most o( n) steps, wheren is the number of steps that you would have taken if you had knownwhere the door was and walked directly to it.