Non-tight Lower boundWe write f(n)=O(g(n))f(n) = O(g(n))f(n)=O(g(n)) if there exist constants c>0,n0>0c>0, n_0>0c>0,n0>0 such that 0≤cg(n)≤f(n)0 \le cg(n) \le f(n) 0≤cg(n)≤f(n) for all n≥n0n \ge n_0n≥n0 velog.iohttps://velog.io/@wan088/시간-복잡도-big-O-big-big-