Analyze the worst-case time complexity of the LoopMystery algorithm below. Show your work. You may assume that d = θ(2i) after iteration i of the while loop in lines 3-10, for every iteration.