Consider the algorithm below. What is the running time in notation? For this problem, you must briefly justify your answer. By briefly justify, I mean that you need to write enough that a knowledgeable reader would understand why your answer is correct. While (n > 2) -non - Do placeholder stuff that takes O(1) time